#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second

#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";

typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pl;

ld const PI = 4*atan((ld)1);

int const N = 107;

int X[N], Y[N];
int main()
{
	fastio;

	int n;
	cin >> n;

	for (int i = 0; i < n; ++i)
		cin >> X[i] >> Y[i];

	for (int i = 0; i < n; ++i)
		for (int j = i+1; j < n; ++j)
			for (int k = j+1; k < n; ++k)
	{
		if ((Y[j] - Y[i]) * (X[k] - X[j]) == (Y[k] - Y[j]) * (X[j] - X[i]))
		{
			//cout << i << " " << j << " " << k << '\n';
			cout << "Yes\n";
			return 0;
		}
	}
	cout << "No\n";
	return 0;
}

#include<bits/stdc++.h>
//#define int long long int
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fastm_fast ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
using namespace std;
const int  mod = 1e9 + 7;
const int MAX = 2e5+5;
typedef pair<int, int> pii;
typedef vector<int> vi ;
typedef vector<string> vs;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef map<int,int> mapii ;

void sujho(){
    int n ; 
    cin >> n ; 
    vector<pair<int,string> > v;

    for(int i = 0; i < n; i++){
        int x ;
        string s; 
        cin >> s ; 
        cin >> x;
        v.push_back({x,s});
    }
    sort(all(v));

    cout << v[n-2].second;
     
    


}
int main()
{
 fastm_fast;
//  int test;cin >> test;
//  for(int i = 1; i <= test; i++)
 { //cout << "Case #"<< test << ":";
     sujho();
 }
 return 0;
}