#include<bits/stdc++.h>
using namespace std;
const int base1 = 19260817, base2 = 919260817, mod1 = 998244353, mod2 = 1e9 + 9;
int Add(int x, int y, int mod) {
    return (x += y) >= mod ? x - mod : x;
}
int Sub(int x, int y, int mod) {
    return (x -= y) < 0 ? x + mod : x;
}
int Mul(int x, int y, int mod) {
    return 1ll * x * y % mod;
}
int Pow(int x, int y, int mod) {
    int res = 1;
    for(; y; x = Mul(x, x, mod), y >>= 1)
        if(y & 1)
            res = Mul(res, x, mod);
    return res;
}
typedef pair<int, int> pii;
pii base = {base1, base2};
#define x first
#define y second
pii operator + (pii a, pii b) {
    return {Add(a.x, b.x, mod1), Add(a.y, b.y, mod2)};
}
pii operator - (pii a, pii b) {
    return {Sub(a.x, b.x, mod1), Sub(a.y, b.y, mod2)};
}
pii operator * (pii a, pii b) {
    return {Mul(a.x, b.x, mod1), Mul(a.y, b.y, mod2)};
}
#undef x
#undef y
const int maxn = 8e5 + 5, maxl = 2e6 + 5;
pii pw[maxn], ipw[maxn], h1[maxn];
int n, dif1[maxn], dif2[maxn];
vector<int> pos1[maxl], pos2[maxl];
set<int> now;
int main() {
    n = 8e5;
    pw[0] = {1, 1};
    for(int i = 1; i <= n; ++ i) {
        pw[i] = pw[i - 1] * base;
    }
    ipw[n].first = Pow(pw[n].first, mod1 - 2, mod1);
    ipw[n].second = Pow(pw[n].second, mod2 - 2, mod2);
    for(int i = n; i; -- i) {
        ipw[i - 1] = ipw[i] * base;
// assert(pw[i] * ipw[i] == make_pair(1, 1));
// cerr << (pw[i] * ipw[i]).first << " " << (pw[i] * ipw[i]).second << endl;
    }
    scanf("%d", &n);
    for(int i = 1; i <= n; ++ i) {
        double x, y;
        scanf("%lf%lf", &x, &y);
        int dx = (int)round((x + 90) * 10000);
        int dy = (int)round((y + 180) * 10000);
        pos1[dx].push_back(dy);
    }
    for(int i = 1; i <= n; ++ i) {
        double x, y;
        scanf("%lf%lf", &x, &y);
        int dx = (int)round((x + 90) * 10000);
        int dy = (int)round((y + 180) * 10000);
        pos2[dx].push_back(dy);
    }
    int all = 3600000, fst = 1;
    for(int x = 0; x < maxl; ++ x) {
        if(pos1[x].size() != pos2[x].size()) {
            puts("Different");
            return 0;
        }
        if(pos1[x].size()) {
            sort(pos1[x].begin(), pos1[x].end());
            sort(pos2[x].begin(), pos2[x].end());
// cerr << "x = " << x << "?? " << endl;
            set<int> nxt;
            nxt.clear();
            int w = pos1[x].size();
// for(int i = 0; i < w; ++ i) {
//     cerr << pos1[x][i] << " " << pos2[x][i] << endl;
// }
            pii h2 = {0, 0};
            for(int i = 0; i < w; ++ i) {
                dif1[i] = dif1[i + w] = (pos1[x][(i + 1) % w] - pos1[x][i] + all) % all;
                dif2[i] = (pos2[x][(i + 1) % w] - pos2[x][i] + all) % all;
// cerr << dif1[i] << " " << dif2[i] << endl;
                h2 = h2 + pw[i] * make_pair(dif2[i], dif2[i]);
            }
            for(int i = 0; i < 2 * w; ++ i) {
                h1[i + 1] = h1[i] + pw[i] * make_pair(dif1[i], dif1[i]);
            }
            for(int i = 0; i < w; ++ i) {
                if((h1[i + w] - h1[i]) * ipw[i] == h2) {
                    int dy = (pos2[x][0] - pos1[x][i] + all) % all;
// cerr << "dx = " << x << " Fuck " << dy << " " << now.count(dy) << endl;
                    if(fst || now.count(dy)) {
                        // cerr << "? " << dy << endl;
                        nxt.insert(dy);
                    }
                }
            }
            swap(now, nxt);
// for(auto x : now)
//     cerr << x << " ";cerr << endl;
            fst = 0;
        }
    }
    puts(now.size() ? "Same" : "Different");
}