//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll Round=360*10000;
map<int,vector<int>> vec1,vec2;
map<int,int> val;
const int B=21;
ll C[B][B];
mt19937_64 rnd(20210448);
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=0;i<B;i++)
		C[i][i]=C[i][0]=1;
	for(int i=0;i<B;i++)
		for(int j=1;j<i;j++)
			C[i][j]=(C[i-1][j]+C[i-1][j-1])%Round;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		double x,y;
		cin>>x>>y;
		int xx=floor(x*10000+0.1);
		int yy=floor(y*10000+0.1);
		vec1[xx].pb(yy);
	}
	for(int i=1;i<=n;i++)
	{
		double x,y;
		cin>>x>>y;
		int xx=floor(x*10000+0.1);
		int yy=floor(y*10000+0.1);
		vec2[xx].pb(yy);
	}
	for(auto pr:vec1)
	{
		vector<int> v1=pr.second,v2=vec2[pr.first];
		for(auto &x:v1)
			x=(x+Round)%Round;
		for(auto &x:v2)
			x=(x+Round)%Round;
		srt(v2);
		if(sz(v1)!=sz(v2)) die("Different");
		vector<int> pool;
		for(auto x:v2)
			pool.pb((x+Round+Round-v1[0])%Round);
		srt(pool);
		uni(pool);
		static ll s[B],s2[B];
		memset(s,0,sizeof(s));
		memset(s2,0,sizeof(s2));
		for(auto x:v1)
		{
			ll val=(x+Round)%Round;
			ll tmp=1;
			for(int i=0;i<B;i++)
			{
				s[i]=(s[i]+tmp)%Round;
				tmp=tmp*val%Round;
			}
		}
		for(auto x:v2)
		{
			ll val=(x+Round)%Round;
			ll tmp=1;
			for(int i=0;i<B;i++)
			{
				s2[i]=(s2[i]+tmp)%Round;
				tmp=tmp*val%Round;
			}
		}
		for(auto delta:pool)
		{
			bool ok=1;
			for(int i=0;i<B;i++)
			{
				ll reals=0;
				ll pw=1;
				for(int j=0;j<=i;j++,pw=pw*delta%Round)
					reals=(reals+pw*s[i-j]%Round*C[i][j])%Round;
				if(reals!=s2[i])
					ok=0;
			}
			for(int i=0;i<B;i++)
			{
				int p1=rnd()%sz(v1);
				int p2=lb(v2,(v1[p1]+delta)%Round);
				if(p2==sz(v2)||v2[p2]!=(v1[p1]+delta)%Round)
					ok=0;
			}
			if(ok)
				val[delta]++;
		}
	}
	for(auto pr:val)
		if(pr.second==sz(vec1))
			die("Same");
	die("Different");
	return 0;
}