#include <bits/stdc++.h>

using namespace std;

#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define x first
#define y second
#define pb emplace_back
#define SZ(x) (int((x).size()))
#define ALL(x) (x).begin(), (x).end()

template<typename T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline bool chkmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

mt19937 rnd;

typedef long long LL;

const int oo = 0x3f3f3f3f;

const int mul = 10000;

const int maxn = 3600100;

int n;

unsigned int number[maxn + 5];

inline int minp(unsigned int *a, int l)
{
	int i = 0, j = 1;
	while (i < l && j < l)
	{
		int k = 0;
		while (a[(i + k) % l] == a[(j + k) % l] && k < l) ++k;
		if (k == l) return i;
		if (a[(i + k) % l] > a[(j + k) % l])
		{
			if (i + k + 1 > j) i += k + 1;
			else i = j + 1;
		}
		else if (j + k + 1 > i) j += k + 1;
		else j = i + 1;
	}
	if (i < l) return i;
	return j;
}

unsigned int a[maxn + 5], b[maxn + 5];

int main()
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	REP(i, 0, 180 * mul + 1)
		number[i] = rnd();
	scanf("%d", &n);
	REP(i, 0, n)
	{
		double x, y;
		scanf("%lf%lf", &x, &y);
		x += 90, y += 180;
		int xx = x * mul + .5, yy = y * mul + .5;
		--yy;
		a[yy] ^= number[xx];
	}
	REP(i, 0, n)
	{
		double x, y;
		scanf("%lf%lf", &x, &y);
		x += 90, y += 180;
		int xx = x * mul + .5, yy = y * mul + .5;
		--yy;
		b[yy] ^= number[xx];
	}
	int N = 360 * mul;
	int ap = minp(a, N), bp = minp(b, N);
	bool isdifferent = 0;
	REP(i, 0, N) if (a[(ap + i) % N] != b[(bp + i) % N]) isdifferent = 1;
	puts(isdifferent ? "Different" : "Same");
	return 0;
}