#include <bits/stdc++.h>
#define maxn 400086

using namespace std;

int n;
map<int, vector<int> > a, b;

const int p[2] = {(int)1e9 + 7, 998244353};
int pw[2][maxn];

vector<tuple<int, int, int> > cal(vector<int> v){
	sort(v.begin(), v.end());
	vector<tuple<int, int, int> > w(v.size());
	for(int i = 0;i < v.size();i++) get<2>(w[i]) = v[i];
	int val = (v[0] - v.back() + 3600000) % 3600000;
	for(int i = (int)v.size() - 1;i > 0;i--) v[i] -= v[i - 1];
	v[0] = val;
//	for(int i = 0;i < v.size();i++) printf("%d ", v[i]);puts("---");
 	int sum = 0;
	for(int i = 0;i < v.size();i++) sum = (1ll * sum * 131 + v[i]) % p[0];
	get<0>(w[0]) = sum;
	for(int i = 0;i + 1 < v.size();i++){
		sum = (1ll * sum * 131 + v[i]) % p[0];
		sum = (sum + p[0] - 1ll * v[i] * pw[0][v.size()] % p[0]) % p[0];
		get<0>(w[i + 1]) = sum;
	}
	sum = 0;
	for(int i = 0;i < v.size();i++) sum = (1ll * sum * 131 + v[i]) % p[1];
	get<1>(w[0]) = sum;
	for(int i = 0;i + 1 < v.size();i++){
		sum = (1ll * sum * 131 + v[i]) % p[1];
		sum = (sum + p[1] - 1ll * v[i] * pw[1][v.size()] % p[1]) % p[1];
		get<1>(w[i + 1]) = sum;
	}
	return w;
}

int main(){
	scanf("%d", &n);
	pw[0][0] = 1;
	for(int j = 1;j <= n;j++) pw[0][j] = 1ll * pw[0][j - 1] * 131 % p[0];
	pw[1][0] = 1;
	for(int j = 1;j <= n;j++) pw[1][j] = 1ll * pw[1][j - 1] * 131 % p[1];
	for(int i = 1;i <= n;i++){
		double x, y;
		scanf("%lf%lf", &x, &y);
		a[(int)round(x * 10000)].push_back((int)round(y * 10000)); 
	}
	for(int i = 1;i <= n;i++){
		double x, y;
		scanf("%lf%lf", &x, &y);
		b[(int)round(x * 10000)].push_back((int)round(y * 10000)); 
	}
	map<int, int> mp;
	for(auto it : a){
		int id = it.first;
		if(it.second.size() != b[id].size()) return printf("Different"), 0;
		auto v = cal(it.second), w = cal(b[id]);
//		printf("%d:\n", id);
//		for(auto it : v) printf("%d %d %d, ", get<0>(it), get<1>(it), get<2>(it));puts("");
//		for(auto it : w) printf("%d %d %d, ", get<0>(it), get<1>(it), get<2>(it));puts("");
		for(auto it : w){
			if(get<0>(it) == get<0>(v[0]) && get<1>(it) == get<1>(v[0])){
				mp[(get<2>(it) - get<2>(v[0]) + 3600000) % 3600000]++;
			}
		}
	}
	for(auto it : mp) if(it.second == a.size()) return printf("Same"), 0;
	printf("Different");
}