To keep his cows intellectually stimulated, Farmer John has placed a large map of the USA on the wall of his barn. Since the cows spend many hours in the barn staring at this map, they start to notice several curious patterns. For example, the cities of Flint, MI and Miami, FL share a very special relationship: the first two letters of "Flint" give the state code ("FL") for Miami, and the first two letters of "Miami" give the state code ("MI") for Flint. Let us say that two cities are a "special pair" if they satisfy this property and come from different states. The cows are wondering how many special pairs of cities exist. Please help them solve this amusing geographical puzzle! \InputFile The first line contains the number $n~(1 \le n \le 2 \cdot 10^5)$ of cities on the map. Each of the next $n$ lines contain two strings: the name of a city (a string of at least $2$ and at most $10$ uppercase letters), and its two-letter state code (a string of $2$ uppercase letters). Note that the state code may be something like ZQ, which is not an actual USA state. Multiple cities with the same name can exist, but they will be in different states. \OutputFile Print the number of special pairs of cities.