#include <bits/stdc++.h>
#ifdef LOCAL
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

vi pi(const basic_string<int>& s) {
    vi p(sz(s));
    rep(i,1,sz(s)) {
        int g = p[i-1];
        while (g && s[i] != s[g]) g = p[g-1];
        p[i] = g + (s[i] == s[g]);
    }
    return p;
}

vi match(const basic_string<int>& s, const basic_string<int>& pat) {
    vi p = pi(pat + 114514 + s), res;
    rep(i,sz(p)-sz(s),sz(p))
        if (p[i] == sz(pat)) res.push_back(i - 2 * sz(pat));
    return res;
}

const int CYCLE = 3600000;
void solve() {
    int n;
    read(n);
    map<int, pair<vi, vi>> mp;
    rep(i,0,n) {
        float fa, fb;
        scanf("%f%f", &fa, &fb);
        int a = int((fa + 90) * 10000 + 0.5); // (0, 9e5)
        int b = int((fb + 180) * 10000 + 0.5); // (0, 1.8e6)
        if(mp.find(a) == mp.end()) {
            mp[a] = {vi(), vi()};
        }
        mp[a].first.push_back(b);
    }
    rep(i,0,n) {
        float fa, fb;
        scanf("%f%f", &fa, &fb);
        int a = int((fa + 90) * 10000 + 0.5); // (0, 9e5)
        int b = int((fb + 180) * 10000 + 0.5) % CYCLE; // [0, 3.6e6)
        if(mp.find(a) == mp.end()) {
            mp[a] = {vi(), vi()};
        }
        mp[a].second.push_back(b);
    }
    vector<pii> keys;
    for(auto& [k, vec] : mp) {
        auto &[va, vb] = vec;
        sort(all(va));
        sort(all(vb));
        if(sz(va) != sz(vb)) {
            cout << "Different" << endl;
            return;
        }
        keys.emplace_back(sz(va), k);
    }
    int smallest_a = -1;
    sort(all(keys));
    for(auto [siz, k]: keys) {
        const auto &[va, vb] = mp[k];
        if(va != vb) {
            smallest_a = k;
            break;
        }
    }
    if(smallest_a == -1) {
        cout<<"Same"<<endl;
        return;
    }

    auto solve = [&]() -> int {
        const auto &[va, vb] = mp[smallest_a];
        debug(va, vb);
        basic_string<int> cnt1(CYCLE, 0), cnt2(CYCLE*2+10, 0);
        for(auto v: va) cnt1[v]++;
        for(auto v: vb) {
            cnt2[v]++;
            cnt2[v+CYCLE]++;
        }
        auto mc = match(cnt2, cnt1);
        assert(sz(mc) == 1 || sz(mc) == 0);
        return sz(mc) == 0 ? -1 : mc[0];
    };

    int ans = solve();
    debug(ans);
    if(ans == -1) {
        cout << "Different" << endl;
        return;
    }
    for(const auto& [k, vec]: mp) {
        const auto&[va, vb] = vec;
        vi vc = va;
        for(auto &g: vc) {
            g = (g + ans) % CYCLE;
        }
        sort(all(vc));
        if(vc != vb) {
            debug("GG", k, va, vb, vc);
            cout << "Different" << endl;
            return;
        }
    }
    cout << "Same" << endl;
}

signed main() {
    int T; T = 1;
    while(T--) solve();
    return 0;
}