#include<bits/stdc++.h>
using namespace std;

using i64 = long long;
using u64 = unsigned long long;

struct debug {
#define contPrint { *this << "["; \
        int f = 0; for(auto it : x) { *this << (f?", ":""); *this << it; f = 1;} \
        *this << "]"; return *this;}
 
    ~debug(){cerr << endl;}
    template<class c> debug& operator<<(c x) {cerr << x; return *this;}
    template<class c, class d>
    debug& operator<<(pair<c, d> x) {*this << "(" << x.first << ", " << x.second << ")"; 
        return *this;}
    template<class c> debug& operator<<(vector<c> x) contPrint;
#undef contPrint
};

#define dbg(x) "[" << #x << ": " << x << "]  "
#define Wa() cerr << "[LINE: " << __LINE__ << "] -> "; debug() << 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);

int main() 
{
    int n;
    scanf("%d", &n);

    auto to_int = [] (char ch[]) {
        int len = strlen(ch);
        int dot = len;
        bool neg = false;
        int start = 0;
        if(ch[0] == '-') neg = true, start = 1;
        for(int i = start; i < len; i++) {
            if(ch[i] == '.') {
                dot = i;
            }
        }

        int ret = 0;
        for(int i = start; i < dot; i++) {
            ret *= 10;
            ret += (ch[i] - '0');
        }

        string s = "";
        for(int i = dot + 1; i < len; i++) {
            s += ch[i];
        }
        while(s.length() < 4) s += '0';

        for(int i = 0; i < 4; i++) {
            ret *= 10;
            ret += (s[i] - '0');
        }
        if(neg) ret *= -1;
        return ret;
    };

    vector<pair<int, int>> fst;
    char ch1[15], ch2[16];
    for(int i = 0; i < n; i++) {
        scanf(" %s %s", ch1, ch2);
        fst.push_back({to_int(ch2), to_int(ch1)});
    }
    sort(fst.begin(), fst.end());
    vector<pair<int, int>> diff;
    for(int i = 0; i < n-1; i++) {
        diff.push_back({fst[i+1].first - fst[i].first, fst[i].second});
    }
    diff.push_back({3600000 - (fst[n-1].first - fst[0].first), fst[n-1].second});
    diff.push_back({-1e9, -1e9});

    vector<pair<int, int>> sec;
    for(int i = 0; i < n; i++) {
        scanf(" %s %s", ch1, ch2);
        sec.push_back({to_int(ch2), to_int(ch1)});
    }
    sort(sec.begin(), sec.end());
    for(int i = 0; i < n-1; i++) {
        diff.push_back({sec[i+1].first - sec[i].first, sec[i].second});
    }
    diff.push_back({3600000 - (sec[n-1].first - sec[0].first), sec[n-1].second});

    // Wa() dbg(diff);

    int len = (int)diff.size();
    vector<int> pi(len);
    for(int i = 1; i < len; i++) {
        int j = pi[i-1];
        while(j > 0 && diff[i] != diff[j]) j = pi[j-1];
        if(diff[i] == diff[j]) j++;
        pi[i] = j;
        if(pi[i] == n) {
            puts("Same");
            return 0;
        }
    }
    puts("Different");
}