#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
  if (b >= (MOD - 1)) b %= (MOD - 1);
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2);
  t1 *= t1;
  t1 %= MOD;
  if (b % 2) t1 *= a;
  t1 %= MOD;
  return t1;
}
long long mpow(long long a, long long b, long long p) {
  if (b == 0) return 1;
  long long t1 = mpow(a, b / 2, p);
  t1 *= t1;
  t1 %= p;
  if (b % 2) t1 *= a;
  t1 %= p;
  return t1;
}
long long modinverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > pts(n);
  for (long long i = 0; i < n; i++) {
    cin >> pts[i].first >> pts[i].second;
  }
  vector<pair<long long, long long> > tp;
  for (long long i = 0; i < n; i++) {
    pair<long long, long long> slp;
    slp.first = pts[(i + 1) % n].first - pts[i].first;
    slp.second = pts[(i + 1) % n].second - pts[i].second;
    if (slp.first < 0) {
      slp.first *= -1;
      slp.second *= -1;
    }
    if (slp.first == 0 && slp.second < 0) {
      slp.second *= -1;
    }
    if (slp.second == 0 && slp.first < 0) {
      slp.first *= -1;
    }
    tp.push_back(slp);
  }
  sort((tp).begin(), (tp).end());
  bool flg = 1;
  if (n % 2 == 1) flg = 0;
  for (long long i = 0; i < n; i++) {
    if (!flg) break;
    if (tp[i] == tp[i + 1]) {
      i++;
    } else {
      flg = 0;
    }
  }
  if (flg) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
