#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define per(i, r, l) for(int i = (r); i >= (l); i --)
#define trv(i, u, v) for(int i = head[u], v = e[i].to; i; v = e[i = e[i].nxt].to)
#define fi first
#define se second
#define all(s) s.begin(), s.end()
#define sz(s) (int)(s.size())
#define lb(s) ((s) & -(s))
#define pb push_back
using namespace std;

typedef long long ll;
typedef unsigned long long u64;
typedef pair<int, int> P;
mt19937_64 hua(time(0));
template<typename T> inline bool chkmx(T &x, T y) {return x < y ? x = y, 1 : 0;}
template<typename T> inline bool chkmn(T &x, T y) {return y < x ? x = y, 1 : 0;}
const int maxn = 8e5;
const int bs = 15023;
int n;
struct Node {
	int x, y;
	void input() {
		double _x, _y;
		scanf("%lf%lf", &_x, &_y);
		x = (_x < 0 ? _x * 1e4 - 1e-5 : _x * 1e4 + 1e-5);
		y = (_y < 0 ? _y * 1e4 - 1e-5 : _y * 1e4 + 1e-5);
	}
		
}a[maxn + 5], b[maxn + 5];
vector<int> ok;
int ret;
vector<int> match(vector<int> p, vector<int> q, int st) {
	u64 pbs[maxn + 5], init = 0;
	if(!init) {
		init = 1;
		pbs[0] = 1;
		rep(i, 1, n << 1) pbs[i] = pbs[i - 1] * bs;
	}
	vector<int> ans;
	vector<u64> h(sz(q) << 1);
	h[0] = q[0];
	rep(i, 1, sz(h) - 1) h[i] = h[i - 1] * bs + q[i % sz(q)];
	u64 ret = p[0];
	rep(i, 1, sz(p) - 1) ret = ret * bs + p[i];
	int qwq = st;
	rep(i, 0, sz(q) - 1) {
		st += p[i];
		u64 cur = h[i + sz(q)] - h[i] * pbs[sz(q)];
		if(cur == ret) {
			ans.pb(st % 3600000);
		}
	}
	return ans;
}
bool chk(int l, int r) {
	vector<int> p, q;
	rep(i, l + 1, r) p.pb(a[i].y - a[i - 1].y);
	p.pb(a[l].y + 3600000 - a[r].y);
	rep(i, l + 1, r) q.pb(b[i].y - b[i - 1].y);
	q.pb(b[l].y + 3600000 - b[r].y);
	vector<int> cur = match(p, q, a[l].y - b[l].y + 3600000);
	if(!ret) return ret = 1, ok = cur, 1;
	else {
		vector<int> nw;
		sort(all(cur));
		for(auto x : cur) {
			if(binary_search(all(ok), x)) nw.pb(x);
		}
		swap(nw, ok);
		if(ok.empty()) return 0;
		return 1;
	}
}
int main() {
	//freopen("in.txt", "r", stdin);
	scanf("%d", &n);
	rep(i, 1, n) a[i].input();
	rep(i, 1, n) b[i].input();
	auto cmp = [&] (Node x, Node y) {return x.x == y.x ? x.y < y.y : x.x < y.x;}; 
	sort(a + 1, a + n + 1, cmp);
	sort(b + 1, b + n + 1, cmp); 
	int flag = 1;
	for(int l = 1, r; l <= n; l = r) {
		r = l;
		while(r <= n && a[r].x == a[l].x) r ++;
		rep(i, l + 1, r - 1) {
			if(b[i].x != b[l].x) flag = 0;
		}
		flag &= b[l].x == a[l].x;
		flag &= r > n || b[r].x != b[l].x;
		flag &= chk(l, r - 1);
	}
	cout << (flag ? "Same" : "Different") << '\n';
	return 0;
}