During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants use random numbers in their programs and are often sent several solutions with the same source code to check.

Each participant is identified by some unique positive integer k, and each sent solution A is characterized by two numbers: x — the number of different solutions that are sent before the first solution identical to A, and k — the number of the participant, who is the author of the solution. Consequently, all identical solutions have the same x.

It is known that the data in the testing system are stored in the chronological order, that is, if the testing system has a solution with numberx(x > 0) of the participant with number k, then the testing system has a solution with number x - 1 of the same participant stored somewhere before.

During the competition the checking system crashed, but then the data of the submissions of all participants have been restored. Now the jury wants to verify that the recovered data is in chronological order. Help the jury to do so.

The first line of the input contains an integer n (1 ≤ n ≤ 10⁵) — the number of solutions. Each of the following n lines contains two integers separated by space x and k (0 ≤ x ≤ 10⁵; 1 ≤ k ≤ 10⁵) — the number of previous unique solutions and the identifier of the participant.

A single line of the output should contain «YES» if the data is in chronological order, and «NO» otherwise.

#include <iostream>

#include <stdio.h>

#include <stdlib.h>

#include<string.h>

#include<algorithm>

#include<math.h>

using namespace std;

int a[];

int main()

{

    int i,n,m,x,k;

    while(cin>>n)

    {

        int flag=;

        memset(a,-,sizeof(a));

        for (i=;i<n;i++)

        {

            cin>>x>>k;

            if (a[k]+<x)

            flag=;

            a[k]=max(a[k],x);

        }

        if (flag)

        cout<<"NO"<<endl;

        else

        cout<<"YES"<<endl;

    }

   return ;

}