There is a group of n children. According to a proverb, every man to his own taste. So the children value strawberries and raspberries differently. Let’s say that i-th child rates his attachment to strawberry as s_i and his attachment to raspberry as r_i.

According to another proverb, opposites attract. Surprisingly, those children become friends whose tastes differ.

Let’s define friendliness between two children v, u as: p(v, u) = sqrt((s_v − s_u)² + (r_v − r_u)²)

The friendliness between three children v, u, w is the half the sum of pairwise friendlinesses: p(v,u,w) = (p(v,u) + p(v,w) + p(u,w)) / 2

The best friends are that pair of children v, u for which v ≠ u and p(v, u) ≥ p(v,u,w) for every child w. Your goal is to find all pairs of the best friends.

In the first line there is one integer n — the amount of children (2 ≤ n ≤ 2 · 10⁵).

In the next n lines there are two integers in each line — s_i and r_i (−10⁸ ≤ s_i, r_i ≤ 10⁸).

It is guaranteed that for every two children their tastes differ. In other words, if v ≠ u then s_v ≠ s_u or r_v ≠ r_u.

Output the number of pairs of best friends in the first line.

Then output those pairs. Each pair should be printed on a separate line. One pair is two numbers — the indices of children in this pair. Children are numbered in the order of input starting from 1. You can output pairs in any order. You can output indices of the pair in any order.

It is guaranteed that the amount of pairs doesn’t exceed 10⁵.