Codeforces Beta Round #35 (Div. 2) / 35A Shell Game(模拟)

A. Shell Game

http://codeforces.com/problemset/problem/35/A

time limit per test

2 seconds

memory limit per test

64 megabytes

input

input.txt

output

output.txt

Today the «Z» city residents enjoy a shell game competition. The residents are gathered on the main square to watch the breath-taking performance. The performer puts 3 non-transparent cups upside down in a row. Then he openly puts a small ball under one of the cups and starts to shuffle the cups around very quickly so that on the whole he makes exactly 3 shuffles. After that the spectators have exactly one attempt to guess in which cup they think the ball is and if the answer is correct they get a prize. Maybe you can try to find the ball too?

Input

The first input line contains an integer from 1 to 3 — index of the cup which covers the ball before the shuffles. The following three lines describe the shuffles. Each description of a shuffle contains two distinct integers from 1 to 3 — indexes of the cups which the performer shuffled this time. The cups are numbered from left to right and are renumbered after each shuffle from left to right again. In other words, the cup on the left always has index 1, the one in the middle — index 2 and the one on the right — index 3.

Output

In the first line output an integer from 1 to 3 — index of the cup which will have the ball after all the shuffles.

Sample test(s)

input

1
1 2
2 1
2 1

output

2

input

1
2 1
3 1
1 3

output

2

water.

/*30ms,100KB*/

#include<cstdio>

int main()
{
	int ball, n = 3;
	int a, b;
	
	freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
	
	scanf("%d", &ball);
	while (n--)
	{
		scanf("%d%d", &a, &b);
		if (a == ball)
			ball = b;
		else if (b == ball)
			ball = a;
	}
	printf("%d", ball);
	return 0;
}