CF432B.Football Kit

Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color x__i and the kit for away games of this team has color y__i (x__i ≠ y__i).

In the tournament, each team plays exactly one home game and exactly one away game with each other team (n(n - 1) games in total). The team, that plays the home game, traditionally plays in its home kit. The team that plays an away game plays in its away kit. However, if two teams has the kits of the same color, they cannot be distinguished. In this case the away team plays in its home kit.

Calculate how many games in the described tournament each team plays in its home kit and how many games it plays in its away kit.

考虑一场有 $n$ 支球队参加的足球锦标赛。每支球队有两套球衣：主场球衣和客场球衣。第 $i$ 支球队的主场球衣颜色为 $x_i$，客场球衣颜色为 $y_i$（其中 $x_i \neq y_i$）。

在该锦标赛中，每支队伍恰好与其他每支队伍各进行一场主场赛事和一场客场赛事（共 $n(n-1)$ 场比赛）。按传统，主场作战的球队身穿其主场球衣；客场作战的球队身穿其客场球衣。然而，若主队与客队的球衣颜色相同，则双方将无法区分。此时，客队改穿其主场球衣。

请计算：在上述锦标赛中，每支球队分别有多少场比赛身穿主场球衣，多少场比赛身穿客场球衣。

The first line contains a single integer n (2 ≤ n ≤ 105) — the number of teams. Next n lines contain the description of the teams. The i-th line contains two space-separated numbers x__i, y__i (1 ≤ x__i, y__i ≤ 105; x__i ≠ y__i) — the color numbers for the home and away kits of the i-th team.

第一行包含一个整数 $n$（$2 \leq n \leq 10^5$）—— 队伍的数量。接下来的 $n$ 行描述各支队伍。第 $i$ 行包含两个以空格分隔的整数 $x_i$、$y_i$（$1 \leq x_i, y_i \leq 10^5$；$x_i \neq y_i$）—— 分别表示第 $i$ 支队伍主场和客场队服的颜色编号。

For each team, print on a single line two space-separated integers — the number of games this team is going to play in home and away kits, correspondingly. Print the answers for the teams in the order they appeared in the input.

对于每支队伍，在一行中输出两个用空格分隔的整数——分别表示该队将身穿主场球衣和客场球衣进行的比赛场数。请按照输入中队伍出现的顺序输出各队的答案。