#include <bits/stdc++.h>

#define ll long long
#define ld long double

using namespace std;

ll n, i, p1[800501], p2[800501];

ld a, b;

pair < ll, ll > c1[400501], c2[400501], s[800501];

int main(){
    cin >> n;

    for (i = 1; i <= n; i++){
        cin >> a >> b;
        c1[i] = {a * 1e4, b * 1e4 + 180 * 1e4};
    }

    for (i = 1; i <= n; i++){
        cin >> a >> b;
        c2[i] = {a * 1e4, b * 1e4 + 180 * 1e4};
    }

    sort(c1 + 1, c1 + n + 1, [&](pair < ll, ll > i, pair < ll, ll > j){return i.second < j.second || (j.second == i.second && i.first < j.first);});
    sort(c2 + 1, c2 + n + 1, [&](pair < ll, ll > i, pair < ll, ll > j){return i.second < j.second || (j.second == i.second && i.first < j.first);});
    ll f1 = -c1[n].second + c1[1].second, f2 = -c2[n].second + c2[1].second;
    for (i = n; i >= 2; i--){
        c1[i].second -= c1[i - 1].second;
        c2[i].second -= c2[i - 1].second;
    }
    c1[1].second = f1;
    c2[1].second = f2;

    for (i = 0; i < n; i++){
        s[i] = c1[i + 1];
    }
    s[n] = {-1e9, -1e9};
    for (i = n + 1; i <= n + 1 + n - 1; i++){
        s[i] = c2[i - n];
    }

    for (i = 1; i <= n + 1 + n - 1; i++){
        int j = p1[i - 1];
        while (j > 0 && s[i] != s[j]){
            j = p1[j - 1];
        }
        if (s[i] == s[j]) j++;
        p1[i] = j;
    }

    reverse(c1 + 1, c1 + n + 1);
    reverse(c2 + 1, c2 + n + 1);
    for (i = 0; i < n; i++){
        s[i] = c1[i + 1];
    }
    s[n] = {-1e9, -1e9};
    for (i = n + 1; i <= n + 1 + n - 1; i++){
        s[i] = c2[i - n];
    }

    for (i = 1; i <= n + 1 + n - 1; i++){
        int j = p2[i - 1];
        while (j > 0 && s[i] != s[j]){
            j = p2[j - 1];
        }
        if (s[i] == s[j]) j++;
        p2[i] = j;
    }

//    cout << p1[n + 1 + n - 1] << " " << p2[n + 1 + n - 1] << '\n';
    if (p1[n + 1 + n - 1] + p2[n + 1 + n - 1] >= n) cout << "Same\n";
    else cout << "Different\n";
}