Cube Stacking

1988:Cube Stacking

总时间限制: 

2000ms

单个测试点时间限制: 

1000ms

内存限制: 

65536kB

描述

Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a single cube. Farmer John asks Betsy to perform P (1<= P <= 100,000) operation. There are two types of operations:
moves and counts.
* In a move operation, Farmer John asks Bessie to move the stack containing cube X on top of the stack containing cube Y.
* In a count operation, Farmer John asks Bessie to count the number of cubes on the stack with cube X that are under the cube X and report that value.

Write a program that can verify the results of the game.

输入

* Line 1: A single integer, P

* Lines 2..P+1: Each of these lines describ