namespace AtCoder; #nullable enable using System.Numerics; using R = Rational; readonly record struct Rational : IAdditiveIdentity, Rational>, IAdditionOperators, Rational, Rational>, ISubtractionOperators, Rational, Rational>, IUnaryNegationOperators, Rational>, IMultiplicativeIdentity, Rational>, IMultiplyOperators, Rational, Rational>, IDivisionOperators, Rational, Rational>, IComparable>, IEqualityOperators, Rational, bool>, IComparisonOperators, Rational, bool> where T : IBinaryInteger, IConvertible { public T P { get; private init; } public T Q { get; private init; } public Rational(T p, T q) { if (q == T.Zero) throw new DivideByZeroException(); if (q < T.Zero) (p, q) = (-p, -q); var (x, y) = (T.Abs(p), q); while (y > T.Zero) (x, y) = (y, x % y); (P, Q) = (p / x, q / x); } public Rational(T p) { (P, Q) = (p, T.One); } public static Rational AdditiveIdentity => new(T.Zero); public static Rational MultiplicativeIdentity => new(T.One); public static implicit operator Rational(T i) => new(i); public static Rational operator -(Rational r) => new(-r.P, r.Q); public static Rational operator +(Rational r1, Rational r2) => new(r1.P * r2.Q + r1.Q * r2.P, r1.Q * r2.Q); public static Rational operator -(Rational r1, Rational r2) => new(r1.P * r2.Q - r1.Q * r2.P, r1.Q * r2.Q); public static Rational operator *(Rational r1, Rational r2) => new(r1.P * r2.P, r1.Q * r2.Q); public static Rational operator /(Rational r1, Rational r2) => new(r1.P * r2.Q, r1.Q * r2.P); public static bool operator <(Rational r1, Rational r2) => r1.CompareTo(r2) < 0; public static bool operator <=(Rational r1, Rational r2) => r1.CompareTo(r2) <= 0; public static bool operator >(Rational r1, Rational r2) => r1.CompareTo(r2) > 0; public static bool operator >=(Rational r1, Rational r2) => r1.CompareTo(r2) >= 0; public int CompareTo(Rational r) => (P * r.Q).CompareTo(Q * r.P); public override string ToString() => Q == T.One ? P.ToString()! : (P.ToDouble(null) / Q.ToDouble(null)).ToString(); } static class Extensions { public static T[] Repeat(this int time, Func F) => Enumerable.Range(0, time).Select(_ => F()).ToArray(); } class AtCoder { object? Solve() { var n = Int(); var points = n.Repeat(() => (new R(Int()), new R(Int()))); var inf = new R(long.MaxValue); var d = new Dictionary<(R, R, R), int>(); for (var i = 0; i < n; i++) for (var j = 0; j < i; j++) { var (xi, yi) = points[i]; var (xj, yj) = points[j]; var xm = (xi + xj) / 2; var ym = (yi + yj) / 2; var dx = xi - xj; var dy = yi - yj; var l = inf; if (dx != 0) l = dy / dx; var key = (xm, ym, l); if (d.TryGetValue(key, out var c)) d[key] = c + 1; else d[key] = 1; } var ans = 0L; foreach (var ((x, y, l), c) in d) { var cl = inf; if (l == inf) cl = 0; else if (l != 0) cl = -1 / l; var ck = (x, y, cl); if (d.TryGetValue(ck, out var cc)) ans += (long)c * cc; } return ans / 2; } public static void Main() => new AtCoder().Run(); public void Run() { var res = Solve(); if (res != null) { if (res is bool yes) res = yes ? "Yes" : "No"; sw.WriteLine(res); } sw.Flush(); } string[] input = Array.Empty(); int iter = 0; readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false }; string String() { while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0); return input[iter++]; } T Input() where T : IParsable => T.Parse(String(), null); int Int() => Input(); void Out(object? x, string? separator = null) { separator ??= Environment.NewLine; if (x is System.Collections.IEnumerable obj and not string) { var firstLine = true; foreach (var item in obj) { if (!firstLine) sw.Write(separator); firstLine = false; sw.Write(item); } } else sw.Write(x); sw.WriteLine(); } }