#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <vector>

#include <queue>

#include <cmath>

#include <map>

#include <algorithm>

using namespace std;

vector<string> ve;

map<string,int>mp;

map<string,int>mz;

int p[];

int main()

{

    int n,maxz,i;

    string str;

    cin>>n;

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

    {

        cin>>str>>p[i];

        mp[str] = ;

        mz[str] = ;

        ve.push_back(str);

    }

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

    {

        mp[ve[i]] += p[i];

    }

    for(map<string,int>::iterator it = mp.begin();it != mp.end();it ++)

    {

        maxz = max(maxz,it->second);

    }

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

    {

        mz[ve[i]] += p[i];

        if(mz[ve[i]] >= maxz&&mp[ve[i]] == maxz)

        {

            cout<<ve[i]<<endl;

            break;

        }

    }

    return ;

}

#include <cstdio>

#include <string>

#include <cstring>

#include <cmath>

#include <cstdlib>

#include <ctime>

#include <iostream>

using namespace std;

#define eps 1e-10

int a[] = {,,,-};

int b[] = {,-,,};

struct point

{

    double x,y;

};

point p[];

double r[];

double dis(point a,point b)

{

    return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));

}

point Rotate(point p,double angle)

{

    point res;

    res.x = p.x*cos(angle) - p.y*sin(angle);

    res.y = p.x*sin(angle) + p.y*cos(angle);

    return res;

}

double CirPoint(point a,point b,double r)

{

    double line = sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y));

    return line/r;

}

int main()

{

    double x,y;

    int i,j;

    srand(time(NULL));

    x = y = ;

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

    {

        scanf("%lf%lf%lf",&p[i].x,&p[i].y,&r[i]);

        x += p[i].x;

        y += p[i].y;

    }

    x = x/;

    y = y/;

    double temp[],avg,tsqs;

    double sqs = ;

    point ans,t;

    ans.x = ;

    ans.y = ;

    int T = ,key,k,flag = ;

    key = ;//key步长,T是温度

    while(T --)

    {

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

        {

            k = rand()%key;

            t.x = x + k*a[i]*T/100000.0;

            t.y = y + k*b[i]*T/100000.0;

            avg = ;

            //利用 点到圆心距离 与 半径之比 表示这个角度

            for(j = ;j < ;j ++)

            {

                temp[j] = CirPoint(t,p[j],r[j]);

                avg += temp[j];

            }

            avg = avg/;

            tsqs = ;

            for(j = ;j < ;j ++)//方差

            {

                tsqs += (temp[j]-avg)*(temp[j]-avg);

            }

            if(sqs > tsqs)

            {

                sqs = tsqs;

                x = t.x;

                y = t.y;

            }

            if(tsqs < eps&&tsqs > -eps)

            {

                flag = ;

                if(dis(p[],t) < dis(p[],ans))

                ans = t;

            }

        }

    }

    if(flag)

    printf("%lf %lf\n",ans.x+eps,ans.y+eps);

    return ;

}