King Jia is interested in triangle.  One night he saw a lot of stars in the sky, he began to choose three stars to form a triangle and calculate which triangle was the largest. Again and again to choose, he has been elected almost 100 years. As you know, his girlfriend began to do not care about him. Now only you can help him. (King Jia think three stars can form a triangle even though the area is zero).

The input consists of multiple test cases

For each case the first line contains one integer N (3 <= N <= 100,000) which means the number of stars. then for each line of next N lines contains two integers x, y which mean the coordinate of each star.      (0 <= x, y <= 1000,000).

For each case, The first line of output contains one integer which means how many triangles that he can get. And the second line contains the maximum value of these triangles (keep two decimal)

5
0 0
0 5
5 0
1 1
2 2

10
12.50