#include <bits/stdc++.h>
#define ll long long

using namespace std;

int _ = 1;


void _solve() {
    int n;
    cin>>n;
    vector< vector<int> >v(n , vector<int>(2));
    for(int i = 0 ; i <n ;i++) {
        cin>>v[i][0]>>v[i][1];
    }

    int ans = 0;

    for(int i = 0 ; i  <n ;i++) {
        for(int j = i+1 ; j < n ;j++) {
            int dx = v[j][0] - v[i][0];
            int dy = v[j][1] - v[i][1];
            if(dx < 0){
                dx *= -1;
                dy *= -1;
            }
            int slope = dy;
            if(slope >= -dx && slope <= dx){
                ans ++;
            }
        }
    }
    cout<<ans<<'\n';
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    while(_--)_solve();
    return 0;
}

#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define po pop_back
#define mp make_pair
#define fi first
#define se second
#define LLM LONG_LONG_MAX
#define LLm LONG_LONG_MIN
#define hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
using namespace std;
bool comp(ll a,ll b){if(a>b)return true;else return false;}
int isP(ll n){if(n==1)return 0;if(n==2 || n==3)return 1;for(ll i=2;i<=sqrt(n);i++){if(n%i==0)return 0;}return 1;}
ll power(ll a,ll b){if(b==0)return 1;if(b==1) return a;ll t=power(a,b/2);if(b%2==1) return t*t*a;else return t*t;}
ll powMOD(ll x,ll y){if(y==0)return 1;if(y==1)return x;ll t=powMOD(x,y/2);if(y%2==1)return t*t%MOD*x%MOD;else return t*t%MOD;}

int main()
{
    /*//----Hello World----//*/
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    hello;
    
    ll t;
//    cin>>t;
    t=1;
    while(t--){
    	ll n;
    	cin>>n;
    	pair<ll,string> p[n+1];
    	for(ll i=1;i<=n;i++) cin>>p[i].se>>p[i].fi;
    	sort(p+1,p+n+1);
    	string ans=p[n-1].se;
    	cout<<ans<<"\n";
	}
    
	/*//----Hello World----//*/
    return 0;  
}