#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
using pi=pair<int,int>;
#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) rng(i,0,n)
#define repn(i,n) rng(i,1,n+1)
#define a first
#define b second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define tct template<class t>
tct using vc=vector<t>;
using vi=vc<int>;
template<class S>
vi zalgo(const S&s){
	int n=s.size();
	vi res(n+1,0);
	int j=0;
	rng(i,1,n)
		if(j+res[j]>i+res[i-j])
			res[i]=res[i-j];
		else{
			res[i]=max(int(0),j+res[j]-i);
			while(i+res[i]<n&&s[res[i]]==s[i+res[i]])
				res[i]++;
			j=i;
		}
	res[0]=n;
	return res;
}
void slv(){
	int n; cin >> n;
	vc<pi>vec[2];
	vc<ll>diff[2];
	rep(j, 2){
		rep(i, n){
			double a,b;cin>>a>>b;
			a+=90; b+=180;
			int x=(int)floor(a*10000+0.5);
			int y=(int)floor(b*10000+0.5);
			vec[j].eb(x, y);
		}
		sort(vec[j].begin(), vec[j].end(), [](pi a, pi b){
			if(a.b != b.b) return a.b < b.b;
			return a.a < b.a;});
			
		rep(i, vec[j].size()){
			int dx, dy;
			if(i+1 < vec[j].size()){
				dx = vec[j][i+1].a-vec[j][i].a+900000;
				dy = vec[j][i+1].b-vec[j][i].b;
			}
			else{
				dx = vec[j][0].a-vec[j][i].a+900000;
				dy = vec[j][0].b-vec[j][i].b+3600000;
			}
			diff[j].pb(10000000LL*dx+dy);
		}
	}
	vc<ll>A = diff[0];
	rep(j, diff[1].size()) A.pb(diff[1][j]);
	rep(j, diff[1].size()) A.pb(diff[1][j]);
	
	auto B = zalgo(A);
	for(int i=n;i<n+n;i++){
		if(B[i] >= n){
			if(vec[0][0].a == vec[1][i-n].a){
				cout << "Same\n";
				return ;
			}
		}
	}
	cout << "Different\n";
}
	
		
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	slv();
}