10167 - Birthday Cake//枚举

/*简单的枚举*/
#include<cstdio>
#include<cstring>
using namespace std;
int a[4][2];
int main()
{
    int N;
    while(scanf("%d",&N) && N)
    {
        for(int i = 0; i < 2*N; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            a[i][0] = x;
            a[i][1] = y;
        }
        for(int i = -500; i <= 500; i++)
        {
            int flag = 0;
            for(int j = -500; j <= 500; j++)
            {
                int num1 = 0;
                int num2 = 0;
                int tag = 0;
                if( i == 0 && j == 0) continue;
                for(int k = 0; k < 2*N; k++)
                {
                    if(i * a[k][0] + j * a[k][1] < 0) num1++;
                    else if(i * a[k][0] + j * a[k][1] > 0) num2++;
                    else tag = 1;
                }
                if(num1 == num2 && !tag)
                {
                    printf("%d %d\n",i,j);
                    flag = 1;
                }
                if(flag) break;
            }
            if(flag) break;
        }
    }
    return 0;
}