#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
const int N = 3600000;
const int B = 4000001;
const int P0 = 1000000007;
const int P1 = 998244353;

int n;
vector <int> va[N],vb[N];
int pB[2][N],sa[N],sb[N],hb[2][N];

bool solve(){
    cin >> n;
    for(int i = 1;i <= n;i ++){
        db x,y; cin >> x >> y;
        int cx = x * 10000 + 900000;
        int cy = y * 10000 + 1800000;
        va[cx].push_back(cy);
    }
    for(int i = 1;i <= n;i ++){
        db x,y; cin >> x >> y;
        int cx = x * 10000 + 900000;
        int cy = y * 10000 + 1800000;
        vb[cx].push_back(cy);
    }
    pB[0][0] = pB[1][0] = 1;
    for(int i = 1;i <= n + n;i ++){
        pB[0][i] = 1ll * B * pB[0][i - 1] % P0;
        pB[1][i] = 1ll * B * pB[1][i - 1] % P1;
    } 
    int num = 0;
    map <int,int> mp;
    for(int i = 0;i <= 1800000;i ++){
        if(va[i].size() != vb[i].size()) return 0;
        if(va[i].size() == 0) continue;
        num ++;
        sort(va[i].begin(),va[i].end());
        sort(vb[i].begin(),vb[i].end());

        int sz = va[i].size();
        for(int j = 1;j < sz;j ++) sa[i] = (va[i][j] - va[i][j - 1] + N) % N;
        sa[sz] = (va[i][0] - va[i].back() + N) % N;
        for(int j = 1;j < sz;j ++) sb[i] = (vb[i][j] - vb[i][j - 1] + N) % N;
        sb[sz] = (vb[i][0] - vb[i].back() + N) % N;

        for(int j = sz + 1;j <= sz + sz;j ++) sb[j] = sb[j - sz];
        for(int j = 1;j <= sz + sz;j ++){
            hb[0][j] = (hb[0][j - 1] + 1ll * pB[0][j - 1] * sb[j]) % P0;
            hb[1][j] = (hb[1][j - 1] + 1ll * pB[1][j - 1] * sb[j]) % P1;
        }
        int xa[2] = {0};
        for(int j = 1;j <= sz;j ++){
            xa[0] = (xa[0] + 1ll * pB[0][j - 1] * sa[j]) % P0;
            xa[1] = (xa[1] + 1ll * pB[1][j - 1] * sa[j]) % P1;
        }
        for(int j = 1;j <= sz;j ++){
            int xb[2] = {0};
            xb[0] = (hb[0][j + sz - 1] - hb[0][j - 1] + P0) % P0;
            xb[1] = (hb[1][j + sz - 1] - hb[1][j - 1] + P1) % P1;
            if(1ll * xa[0] * pB[0][j - 1] % P0 == xb[0] && 1ll * xa[1] * pB[1][j - 1] % P1 == xb[1])
                mp[(vb[i][j - 1] - va[i][0] + N) % N] ++;
        }
    }
    for(auto it = mp.begin();it != mp.end();it ++){
        if(it->second == num) return 1;
    }
    return 0;
}

int main(){
    ios::sync_with_stdio(false);
    cout << (solve() ? "Same" : "Different") << '\n';
    return 0;
}