#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const int C = 10000;
const int AC = 360 * C;

pii arr[400005], brr[400005];

vector<int> mcp(vector<int> v, int &off) {
    int n = SZ(v), i = 0, j = 1;
    for (int k = 0; k < n; ++k)
        v.pb(v[k]);
    while (i < n && j < n) {
        int k = 0;
        while (k < n && v[i + k] == v[j + k]) ++k;
        if (v[i + k] <= v[j + k]) j += k + 1;
        else i += k + 1;
        if (i == j) ++j;
    }
    int ans = i < n ? i : j;
    off = ans;
    return vector<int>(v.begin() + ans, v.begin() + ans + n);
}

int F[400005];
void fail(vector<int> &B) {
    F[0] = -1, F[1] = 0;
    for (int i = 1, j = 0; i < SZ(B); F[++i] = ++j) {
        while (j != -1 && B[i] != B[j]) j = F[j];
    }
}

int vis[AC];
 
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, tag = 0;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        double a, b;
        cin >> a >> b;
        arr[i] = pii(a * C, b * C);
    }
    for (int i = 1; i <= n; ++i) {
        double a, b;
        cin >> a >> b;
        brr[i] = pii(a * C, b * C);
    }

    auto diff = [&]() {
        cout << "Different\n";
        exit(0);
    };

    auto cyc = [&](int x) {
        return (x % AC + AC) % AC;
    };

    sort(arr + 1, arr + n + 1);
    sort(brr + 1, brr + n + 1);
    for (int i = 1, j = 1; i <= n; i = j) {
        ++tag;
        while (j <= n && arr[i].X == arr[j].X) {
            if (arr[j].X != brr[j].X) diff();
            ++j;
        }
        vector<int> da, db;
        da.pb(cyc(arr[i].Y - arr[j - 1].Y));
        db.pb(cyc(brr[i].Y - brr[j - 1].Y));
        for (int k = i + 1; k < j; ++k) {
            da.pb(cyc(arr[k].Y - arr[k - 1].Y));
            db.pb(cyc(brr[k].Y - brr[k - 1].Y));
        }
        int ofa, ofb;
        mcp(da, ofa).swap(da);
        mcp(db, ofb).swap(db);
        if (db != db) diff();
        fail(da);
        vector<int> yes;
        if (F[SZ(da)] * 2 < SZ(da) || SZ(da) % (SZ(da) - F[SZ(da)]) != 0) yes.pb(cyc(brr[i + ofb].Y - arr[i + ofa].Y));
        else {
            for (int k = 0; k < SZ(da); k += SZ(da) - F[SZ(da)])
                yes.pb(cyc(brr[i + ofb].Y - arr[i + (ofa + k) % SZ(da)].Y));
        }
        sort(ALL(yes)), yes.resize(unique(ALL(yes)) - yes.begin());
        for (int k : yes)
            ++vis[k];
        /*for (int k = 0; k < SZ(da); ++k)
            cerr << da[k] << " ";
        cerr << endl;
        for (int k = 0; k < SZ(db); ++k)
            cerr << db[k] << " ";
        cerr << endl;
        cerr << arr[i].X << ": ";
        for (int k : yes)
            cerr << k << " ";
        cerr << endl;*/
    }

    if (*max_element(vis, vis + AC) != tag) diff();
    cout << "Same\n";
}