#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100005;
long long n, x[maxn], y[maxn];
bool flag;
inline long long nxt(long long id) { return (id + 1) % n; }
inline bool check(long long i, long long j) {
  return (x[i] + x[j] == x[nxt(i)] + x[nxt(j)]) &&
         (y[i] + y[j] == y[nxt(i)] + y[nxt(j)]);
}
int main() {
  scanf("%lld", &n);
  if (n % 2 == 1) {
    printf("No\n");
    return 0;
  }
  for (register long long i = 0; i < n; i++) scanf("%lld%lld", &x[i], &y[i]);
  for (register long long i = 0; i * 2 < n; i++)
    if (!check(i, i + (n / 2))) {
      flag = true;
      break;
    }
  if (flag)
    printf("No\n");
  else
    printf("Yes\n");
  return 0;
}
