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

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

int f[N];
void getfail(int sz){
    int j=0;
    for(int i=2;i<=n;i++){
        while(j && sa[i]!=sa[j+1])j=f[j];
        if(sa[i] == sa[j+1])j++;
        f[i]=j;
    }
}

bool solve(){
    cin >> n;
    for(int i = 1;i <= n;i ++){
        db x,y; cin >> x >> y;
        int cx = x * 10000 + 0.1 + 900000;
        int cy = y * 10000 + 0.1 + 1800000;
        va[cx].push_back(cy%N);
    }
    for(int i = 1;i <= n;i ++){
        db x,y; cin >> x >> y;
        int cx = x * 10000 + 0.1 + 900000;
        int cy = y * 10000 + 0.1 + 1800000;
        vb[cx].push_back(cy%N);
    }
    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[j] = (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[j] = (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];
        getfail(sz);
        for(int j = 1,k=0;j < sz + sz;j ++){
            while(k && sb[j] != sa[k+1])k=f[k];
            if(sb[j] == sa[k+1])k++;
            if(k == sz){
                mp[(vb[i][j - sz] - va[i][0] + N) % N] ++;
                k=f[k];
            }
        }
    }
    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;
}