N by N chessboard with N queens

Given an chessboard and N queens with their coordinates, you are asked if there are any two queens that attack each other.

Input

The first line of the input contains a single integer N (1 ≤ N ≤ 100).

The next N lines contain the coordinates of the queens (1 ≤ ≤ N).

Output

The program should print Yes in case there are queens attacking each other and No otherwise.

Examples

Input

Output

4 1 2 2 4 3 1 4 3

No

4 1 1 2 3 3 4 4 2

Yes

Explanation

Screen Shot 2022-11-01 at 11.01.56 AM.png

Example 1

Screen Shot 2022-11-01 at 11.02.47 AM.png

Example 2

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue