#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 2e5 + 5, mod = 360 * 10000;
int freq[mod + 5];

void solve(vector<pair<int, int> > &a, vector<pair<int, int> > &b) {
    b.push_back({-1, -1});
    int m = a.size();
    for (auto i: a) {
        b.push_back(i);
    }
    for (auto i: a) {
        b.push_back(i);
    }

    int n = b.size();
    vector<int> z(n);
    set<int> vis;
    for (int i = 1; i <= 2 * m; i++) {
        while (i + z[i] < n && b[z[i]].second == b[i + z[i]].second) {
            z[i]++;
        }
        if (z[i] == m) {
            int d = b[i].first - b[0].first;
            d = (d % mod + mod) % mod;
            vis.insert(d);
        }
    }
    for (auto i: vis) {
        freq[i]++;
    }
}

int get_val(string s) {
    int n = s.size();
    int idx = s.find('.');
    if (idx == -1) {
        s += "0000";
    } else {
        int rem = 4 - (s.size() - idx - 1);
        s.erase(s.begin() + idx);
        while (rem--) {
            s += '0';
        }
    }
    return stoi(s);
}

void doWork() {
    int n;
    cin >> n;
    vector<pair<int, int> > v1, v2;

    for (int i = 0; i < n; i++) {
        string s1, s2;
        cin >> s1 >> s2;
        v1.push_back({get_val(s1), get_val(s2)});
    }
    for (int i = 0; i < n; i++) {
        string s1, s2;
        cin >> s1 >> s2;
        v2.push_back({get_val(s1), get_val(s2)});
    }

    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    int cnt = 0;
    for (int i = 0; i < n;) {
        int j = i;
        cnt++;

        vector<int> a, b;
        while (j < n && v1[j].first == v1[i].first) {
            a.push_back(v1[j++].second);
        }

        j = i;
        while (j < n && v2[j].first == v2[i].first) {
            b.push_back(v2[j++].second);
        }

        if (v1[i].first != v2[i].first || (int) a.size() != (int) b.size()) {
            cout << "Different";
            return;
        }

        i = j;

        int m = a.size();
        vector<pair<int, int>> da(m), db(m);
        for (int k = 0; k < m; k++) {
            da[k] = {a[k], a[(k + 1) % m] - a[k]};
            if (da[k].second < 0)da[k].second += mod;

            db[k] = {b[k], b[(k + 1) % m] - b[k]};
            if (db[k].second < 0)db[k].second += mod;
        }

        solve(da, db);
    }


    for (int i = 0; i < mod; i++) {
        if (freq[i] == cnt) {
            cout << "same";
            return;
        }
    }
    cout << "Different";
}

int main() {
    IO
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        //cout << "Case #" << i << ": ";
        doWork();
    }
}