#include <bits/stdc++.h>
#define L 800005
#define SHIFT_DECIMALS 10000
#define DEG 360 * SHIFT_DECIMALS
using namespace std;

int n;
pair <int, int> a[L], b[L];
int f[L];

bool cmp(const pair <int, int> &A, const pair <int, int> &B) {
  if (A.second == B.second)
    return A.first < B.first;
  return A.second < B.second;
}

int LMSR_a() {
  int p = 0;
  for (int i = n; i < 2 * n; i++)
    a[i] = a[i - n];
  for (int i = 0; i < 2 * n; i++)
    f[i] = -1;
  int l = 1;
  for (int r = 1; r < 2 * n; r++) {
    l = f[r - p - 1];
    while (l != -1 && a[p + l + 1] != a[r]) {
      if ((a[l + p + 1].second == a[r].second && a[l + p + 1].first > a[r].first) || a[l + p + 1].second > a[r].second)
        p = r - l - 1;
      l = f[l];
    }
    if (l == -1 && a[p + l + 1] != a[r]) {
      if ((a[l + p + 1].second == a[r].second && a[l + p + 1].first > a[r].first) || a[l + p + 1].second > a[r].second)
        p = r;
      f[r - p] = -1;
    }
    else
      f[r - p] = l + 1;
  }
  return p;
}

int LMSR_b() {
  int p = 0;
  for (int i = n; i < 2 * n; i++)
    b[i] = b[i - n];
  for (int i = 0; i < 2 * n; i++)
    f[i] = -1;
  int l = 1;
  for (int r = 1; r < 2 * n; r++) {
    l = f[r - p - 1];
    while (l != -1 && b[p + l + 1] != b[r]) {
      if ((b[l + p + 1].second == b[r].second && b[l + p + 1].first > b[r].first) || b[l + p + 1].second > b[r].second)
        p = r - l - 1;
      l = f[l];
    }
    if (l == -1 && b[p + l + 1] != b[r]) {
      if ((b[l + p + 1].second == b[r].second && b[l + p + 1].first > b[r].first) || b[l + p + 1].second > b[r].second)
        p = r;
      f[r - p] = -1;
    }
    else
      f[r - p] = l + 1;
  }
  return p;
}

int main(){
  cin >> n;
  for (int i = 0; i < n; i++) {
    double x, y;
    cin >> x >> y;
    x *= SHIFT_DECIMALS;
    y *= SHIFT_DECIMALS;
    a[i] = {x, y};
  }
  for (int i = 0; i < n; i++) {
    double x, y;
    cin >> x >> y;
    x *= SHIFT_DECIMALS;
    y *= SHIFT_DECIMALS;
    b[i] = {x, y};
  }
  sort(a, a + n, cmp);
  sort(b, b + n, cmp);
  int aux_a = a[0].second, aux_b = b[0].second;
  for (int i = 0; i < n - 1; i++) {
    a[i].second = a[i + 1].second - a[i].second;
    b[i].second = b[i + 1].second - b[i].second;
  }
  a[n - 1].second = DEG + aux_a - a[n - 1].second;
  b[n - 1].second = DEG + aux_b - b[n - 1].second;
  bool ok = true;
  int shift_a = LMSR_a(), shift_b = LMSR_b();
  for (int i = 0; i < n; i++)
    if (a[(i + shift_a) % n] != b[(i + shift_b) % n])
      ok = false;
  if (ok)
    cout << "Same\n";
  else
    cout << "Different\n";
  return 0;
}