29_A. Spit Problem
In a Berland's zoo there is an enclosure with camels. It is known that camels like to spit. Bob watched these interesting animals for the whole day and registered in his notepad where each animal spitted. Now he wants to know if in the zoo there are two camels, which spitted at each other. Help him to solve this task.

The trajectory of a camel's spit is an arc, i.e. if the camel in position x spits d meters right, he can hit only the camel in position x + d, if such a camel exists.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the amount of camels in the zoo. Each of the following n lines contains two integers xi and di ( - 104 ≤ xi ≤ 104, 1 ≤ |di| ≤ 2·104) — records in Bob's notepad. xi is a position of the i-th camel, and di is a distance at which the i-th camel spitted. Positive values of di correspond to the spits right, negative values correspond to the spits left. No two camels may stand in the same position.

Output

If there are two camels, which spitted at each other, output YES. Otherwise, output NO.

Examples

Input

2
0 1
1 -1


Output

YES


Input

3
0 1
1 1
2 -2


Output

NO


Input

5
2 -10
3 10
0 5
5 -5
10 1


Output

YES
```python
n=int(input())
a1=[]
a2=[]
for i in range(n):
	x,d=list(map(int,input().split()))
	a1.append(x)
	a2.append(d)

flag=1
for i in range(n):
	for j in range(i+1,n):
		if ((a1[i]+a2[i]==a1[j]) and (a1[j]+a2[j]==a1[i])):
			print("YES")
			flag=0
			break
	if(flag==0):
		break
if(flag==1):
	print("NO")

```