Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

HINHTHOI - Hình thoi

Rhombs

A rhomb is a four-sided polygon in which every side has the same length. The rhomb shape appears in the diamonds suit in playing cards, in art patterns, etc. Squares are also special cases of rhombs.

You have to solve a problem about rhombs: given N points in the plane, count the number of rhombs which have four verticles in the given set of points.

Input

  • Line 1: a number N that is the number of points (4 ≤ N ≤ 1500).
  • The ith line of the next N lines contains two integers xi, yi that are coordinates of the ith point (-50 ≤ xi, yi ≤ 50).

Output

Print a single number that is the number of rhombs that have four verticles in the given set of points.

Example

Input
8
-1 0
0 1
1 0
0 0
1 1
0 -1
1 -1
2 0

Output
4

Được gửi lên bởi:VOJ Team
Ngày:2008-08-20
Thời gian chạy:0.100s-1s
Giới hạn mã nguồn:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Ngôn ngữ cho phép:Tất cả ngoại trừ: ERL GOSU JS-RHINO NODEJS PERL6 PYPY RUST SED VB.NET
Nguồn bài:VNOI Marathon '08 - Round 10/DivA
Problem Setter: Ngô Minh Đức

hide comments
2016-05-05 19:09:21
bi 29.41 diem la sao vay moi nguoi ?
2014-06-01 16:15:42 Lollipop
chắc là có điểm trung nhau
2012-10-07 02:15:47 hiepsieunhan
co diem nao trung nhau k vay ??
2012-04-28 17:38:03 trandatbav
Qúa ảo, sao sai hết ri trời
2012-04-15 19:54:37 VOJ Team
New testcases added.
2010-11-02 01:59:16 Võ Quang Hòa
Ủa, có chuyện giới hạn thời gian thấp nhất nữa ta :D
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.