Problem:
Problem E: Symmetry

Open Binary and Object Group organizes a programming contest every year. Mr. Hex belongs to this
group and joins the judge team of the contest. This year, he created a geometric problem with its solution
for the contest. The problem required a set of points forming a line-symmetric polygon for the input.
Preparing the input for this problem was also his task. The input was expected to cover all edge cases, so
he spent much time and attention to make them satisfactory.

However, since he worked with lots of care and for a long time, he got tired before he finished. So He
might have made mistakes - there might be polygons not meeting the condition. It was not reasonable to
prepare the input again from scratch. The judge team thus decided to find all line-asymmetric polygons
in his input and fix them as soon as possible. They asked a programmer, just you, to write a program to
find incorrect polygons.

You can assume the following:

Edges of the polygon must not cross or touch each other except for the end points of adjacent
edges.

It is acceptable for the polygon to have adjacent three vertexes on a line, but in such a case, there
must be the vertex symmetric to each of them.

Input

The input consists of a set of points in the following format.

N

x1 y1

x2 y2

...

xN yN

The first line of the input contains an integer N (3 ≤ N ≤ 1000), which denotes the number of points.
The following N lines describe each point. The i-th line contains two integers x1, y1 (-10000 ≤ xi, yi ≤ 10000), which denote the coordinates of the i-th point.

Note that, although the points are the vertexes of a polygon, they are given in an artibrary order, not
necessarily clockwise or counterclockwise.

Output

Output "Yes" in a line if the points can form a line-symmetric polygon, otherwise output "No".

Sample Input 1

4
0 1
1 0
0 0
1 1

Sample Output 1

Yes

Sample Input 2

4
0 1
1 -1
0 0
1 1

Sample Output 2

No

Sample Input 3

9
-1 1
0 1
1 1
-1 0
0 0
1 0
-1 -1
0 -1
1 -1

Sample Output 3

No

Sample Input 4

3
-1 -1
0 0
1 1

Sample Output 4

No

Sample Input 5

4
0 2
0 0
-1 0
1 0

Sample Output 5

Yes

Solution in Ruby (judge verdict: Accepted)

include Math

n = gets.to_i
points = (1..n).map { gets.split.map(&:to_i) }

if (2..n-1).all? {|i|
  (points[1][1] - points[0][1]) * (points[i][0] - points[0][0]) ==
  (points[i][1] - points[0][1]) * (points[1][0] - points[0][0])
}
  puts 'No'
  exit
end

center = [points.map(&:first).inject(:+) / n.to_f, points.map(&:last).inject(:+) / n.to_f]
points.map! {|x, y| [x - center[0], y - center[1]] }
points.reject! {|x, y| x.abs + y.abs < 1e-5 }
points.sort_by! {|x, y| atan2(y, x) }

a = []
points.each {|point| a << point }
points.each_cons(2) {|p1, p2| a << [(p1[0] + p2[0]) / 2.0, (p1[1] + p2[1]) / 2.0] }
a << [(points[-1][0] + points[0][0]) / 2.0, (points[-1][1] + points[0][1]) / 2.0]

ret = false
a.each do |x0, y0|
  t = atan2(y0, x0)

  rotated = points.map {|x, y| [cos(-t) * x - sin(-t) * y, sin(-t) * x + cos(-t) * y] }
  rotated.map! {|x, y| [x.round(5), y.round(5)] }
  rotated.reject! {|_, y| y.abs < 1e-5 }
  next if rotated.size < n - 2
  upper_points, lower_points = rotated.partition {|_, y| y > 0 }
  next if upper_points.empty? || lower_points.empty?
  next if upper_points.size != lower_points.size
  turned_lower_points = lower_points.map {|x, y| [x, -y] }
  upper_points.sort!
  turned_lower_points.sort!
  if upper_points.zip(turned_lower_points).all? {|p1, p2| (p1[0] - p2[0]).abs + (p1[1] - p2[1]).abs < 1e-5 }
    ret = true
    break
  end
end
puts ret ? 'Yes' : 'No'