#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = (1ull << 61) - 1;
const int BASE = 407;
const int L = 3600000;
inline int Mul(int x, int y) {
    return (__int128)x * y % mod;
}
int cnt[L];
int pwb[L];
inline void Fail() {
    cout << "Different" << endl;
    exit(0);
}
inline void Check(vector<int> a, vector<int> b) {
    if (a.size() != b.size()) Fail();
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int n = a.size();
    vector<int> va(n), vb(n);
    for (int i = 0; i < n; ++i) va[i] = (a[(i + 1) % n] - a[i]);
    for (int i = 0; i < n; ++i) vb[i] = (b[(i + 1) % n] - b[i]);
    vector<int> ha(n), hb(n);
    ha[0] = va[0];
    for (int i = 1; i < n; ++i) ha[i] = (Mul(ha[i - 1], BASE) + va[i]) % mod;
    hb[0] = vb[0];
    for (int i = 1; i < n; ++i) hb[i] = (Mul(hb[i - 1], BASE) + vb[i]) % mod;
    for (int i = 0; i < n; ++i) {
        int vala = ha[n - 1];
        int valb = hb[n - 1];
        if (i) valb = (valb - Mul(hb[i - 1], pwb[n - i]) + mod);
        if (i) valb = Mul(valb, pwb[i - 1]) + hb[i - 1];
        if (vala == valb) ++cnt[(b[i] - a[0] + L) % L];
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    pwb[0] = 1;
    for (int i = 1; i < L; ++i) pwb[i] = Mul(pwb[i - 1], BASE);
    int n;
    cin >> n;
    map<double, pair<vector<int>, vector<int>>> mp;
    for (int i = 1; i <= n; ++i) {
        double x, y;
        cin >> x >> y;
        int ty = ((int)round(y * 10000) + L) % L;
        mp[x].first.push_back(ty);
    }
    for (int i = 1; i <= n; ++i) {
        double x, y;
        cin >> x >> y;
        int ty = ((int)round(y * 10000) + L) % L;
        mp[x].second.push_back(ty);
    }
    for (auto [x, pvv] : mp) Check(pvv.first, pvv.second);
    cout << (*max_element(cnt, cnt + L) == mp.size() ? "Same" : "Different") << endl;
    return 0;
}