#include <bits/stdc++.h>
using namespace std;
inline bool invowel(char ch) {
  ch = tolower(ch);
  return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
inline bool isprime(int n) {
  if (n < 2 || (n % 2 == 0 && n != 2)) return false;
  for (int i = 3; i * i <= n; i += 2)
    if (n % i == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  int t;
  t = 1;
  while (t--) {
    int n, i;
    cin >> n;
    vector<int> x(n), y(n);
    for (i = 0; i < n; i++) {
      cin >> x[i] >> y[i];
    }
    if (n & 1) {
      cout << "No\n";
      break;
    }
    for (i = 0; i < n / 2; i++) {
      if (x[0] + x[n / 2] != x[i] + x[i + n / 2] ||
          y[0] + y[n / 2] != y[i] + y[i + n / 2]) {
        cout << "No\n";
        return 0;
      }
    }
    cout << "Yes\n";
  }
  return 0;
}
