//很久没写过计算几何了,想在东北邀请赛前热热手,找了这道比较水的题,结果还是纠结了一会。
//一开始想当然的以为对称轴必过多边形重心,于是引入了重心优化,结果WA了N次,最后去掉这个,就过了。。。
//加上每条边的中点,一共2*n个点。枚举n条可能的对称轴(p[i], p[i+n]),i从0到n-1。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n;
const double EP=1e-8;
struct Point{
double x, y;
}p[40005], tpoint;
struct Line{
double a, b, c;
}tline;
double x_mult(Point sp, Point ep, Point op){
return (sp.x-op.x)*(ep.y-op.y)-(sp.y-op.y)*(ep.x-op.x);
}
Line makeline(Point p1, Point p2){
Line t1;
int sign=1;
t1.a=p2.y-p1.y;
if(t1.a<0){
t1.a*=-1;
sign=-1;
}
t1.b=sign*(p1.x-p2.x);
t1.c=sign*(p1.y*p2.x-p1.x*p2.y);
return t1;
}
Point vert_p(Point p1, Line l1){ //垂足
Point p2;
p2.x=(l1.b*(l1.b*p1.x-l1.a*p1.y)-l1.a*l1.c)/(l1.a*l1.a+l1.b*l1.b);
p2.y=(l1.a*(l1.a*p1.y-l1.b*p1.x)-l1.b*l1.c)/(l1.a*l1.a+l1.b*l1.b);
return p2;
}
Point sym_p(Point sp, Point op){ //点sp关于点op的对称点
Point p1;
p1.x=2*op.x-sp.x;
p1.y=2*op.y-sp.y;
return p1;
}
Point sym_line(Point p1, Line l1){ //点关于直线的对称点
return sym_p(p1, vert_p(p1, l1));
}
int main(){
//freopen("1.txt", "r", stdin);
int i, j, flag, f;
while(scanf("%d", &n)!=EOF){
f=0;
for(i=0; i<n; i++){
scanf("%lf%lf", &p[2*i].x, &p[2*i].y);
}
p[2*n]=p[0];
for(i=0; i<n; i++){
p[2*i+1].x=(p[2*i].x+p[2*i+2].x)/2;
p[2*i+1].y=(p[2*i].y+p[2*i+2].y)/2;
}
for(i=0; i<n; i++){
flag=1;
tline=makeline(p[i], p[i+n]);
for(j=1; j<n; j++){
tpoint=sym_line(p[(i+j)%(2*n)], tline);
if(fabs(tpoint.x-p[(i-j+2*n)%(2*n)].x)>EP||fabs(tpoint.y-p[(i-j+2*n)%(2*n)].y)>EP){
flag=0;break;
}
}
if(flag){f=1;break;}
}
if(f)printf("YES\n");
else printf("NO\n");
}
return 0;
}