https://codeforces.com/contest/1091/problem/B

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
struct node{
    int x,y;
}a[N],b[N];


char str;
bool  vis[N];
void dfs(int c,int x,int y){
    if(c>n){
        ans=1;
        return;
    }
    for(int i=1;i<=n;i++){
        if(a[c].x+b[i].x==x&&a[c].y+b[i].y==y&&!vis[i]){
            vis[i]=1;
            dfs(c+1,x,y);
            vis[i]=0;
        }
    }
}

int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d%d",&a[i].x,&a[i].y);
    }
    for(int i=1;i<=n;i++){
        scanf("%d%d",&b[i].x,&b[i].y);
    }
    for(int i=1;i<=n;i++){
        vis[i]=1;
        ans=0;
        dfs(2,a[1].x+b[i].x,a[1].y+b[i].y);
        vis[i]=0;
        if(ans){
            cout<<a[1].x+b[i].x<<" "<<a[1].y+b[i].y<<endl;
            break;
        }
    }
    //cout << "Hello world!" << endl;
    return 0;
}