Polycarpus works as a programmer in a start-up social network. His boss gave his a task to develop a mechanism for determining suggested friends. Polycarpus thought much about the task and came to the folowing conclusion. Let's say that all friendship relationships in a social network are given as m username pairs a i , b i ( a i ≠ b i ) . Each pair a i , b i means that users a i and b i are friends. Friendship is symmetric, that is, if a i is friends with b i , then b i is also friends with a i . User y is a suggested friend for user x , if the following conditions are met: x ≠ y ; x and y aren't friends; among all network users who meet the first two conditions, user y has most of all common friends with user x . User z is a common friend of user x and user y ( z ≠ x , z ≠ y ) , if x and z are friends, and y and z are also friends. Your task is to help Polycarpus to implement a mechanism for determining suggested friends. The first line contains a single integer m (1 ≤ m ≤ 5000) — the number of pairs of friends in the social network. Next m lines contain pairs of names of the users who are friends with each other. The i -th line contains two space-separated names a i and b i ( a i ≠ b i ) . The users' names are non-empty and consist of at most 20 uppercase and lowercase English letters. It is guaranteed that each pair of friends occurs only once in the input. For example, the input can't contain x , y and y , x at the same time. It is guaranteed that distinct users have distinct names. It is guaranteed that each social network user has at least one friend. The last thing guarantees that each username occurs at least once in the input. In the first line print a single integer n — the number of network users. In next n lines print the number of suggested friends for each user. In the i -th line print the name of the user c i and the number of his suggested friends d i after a space. You can print information about the users in any order. In the first test