# Swordsman

Problem Description
Mr. AC is a swordsman. His dream is to be the best swordsman in the world. To achieve his goal, he practices every day. There are many ways to practice, but Mr. AC likes “Perfect Cut” very much. The “Perfect Cut” can be described as the following two steps:
1. Put a piece of wood block on the desk, and then suddenly wave the sword, cutting the block into two pieces.
2. Without any motion, the two pieces must be absolutely axial symmetry.
According to the step two, when the board is an axial symmetry figure, Mr. AC has a chance to achieve the “Perfect Cut”. Now give you a board, and you should tell if Mr. AC has a chance to complete the “Perfect Cut”. The board is a simple polygon.

Input
The input contains several cases.
The first line of one case contains a single integer n (3 <= n <= 20000), the number of points. The next n lines indicate the points of the simple polygon, each line with two integers x, y (0 <= x, y <= 20000). The points would be given either clockwise or counterclockwise.

Output
For each case, output the answer in one line. If Mr. AC has the chance, print “YES”, otherwise "NO".

Sample Input
3
0 0
2 0
0 1
4
0 0
0 1
1 1
1 0

Sample Output
NO
YES

• 写回答

#### 1条回答默认 最新

• threenewbee 2018-04-07 16:05
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥20 关于php录入完成后，批量更新数据库
• ¥15 请教往复密封润滑问题
• ¥15 cocos creator发布ios包
• ¥15 comsol压电材料数据
• ¥35 用python实现除法算法中goldschmidt算法
• ¥15 汇编代码转换成C代码
• ¥15 除法算法中的归一化具体是怎么变的？
• ¥20 集成电路的逻辑电路和晶体管简化图
• ¥15 下载windows builder后的问题
• ¥15 端口连接数为什么会有限制