D - Vanya and Triangles

Vanya got bored and he painted n distinct points on the plane. After that he connected all the points pairwise and saw that as a result many triangles were formed with vertices in the painted points. He asks you to count the number of the formed triangles with the non-zero area.

Input

The first line contains integer n (1 ≤ n ≤ 2000) — the number of the points painted on the plane.

Next n lines contain two integers each xi, yi ( - 100 ≤ xi, yi ≤ 100) — the coordinates of the i-th point. It is guaranteed that no two given points coincide.

Output

In the first line print an integer — the number of triangles with the non-zero area among the painted points.

Examples

Input

4
0 0
1 1
2 0
2 2

Output

3

Input

3
0 0
1 1
2 0

Output

1

Input

1
1 1

Output

0

Note

Note to the first sample test. There are 3triangles formed: (0, 0) - (1, 1) - (2, 0); (0, 0) - (2, 2) - (2, 0); (1, 1) - (2, 2) - (2, 0).

Note to the second sample test. There is 1triangle formed: (0, 0) - (1, 1) - (2, 0).

Note to the third sample test. A single point doesn't form a single triangle.

AC代码（看斜率是否相等然后暴力就好了）

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
struct node
{
    int x, y;
}a[2000+10];
int main()
{
   int  n;
    while(scanf("%d",&n)!=EOF)
    {
        int sm = 0;
        int k1, k2;
        for(int i = 0;i<n;i++)
        {
            scanf("%d%d",&a[i].x,&a[i].y);
        }
        for(int i = 0;i<n;i++)
        {
            for(int j = i+1;j<n;j++)
            {
               for(int k = j+1;k<n;k++)
               {
                   k1 =(a[i].y-a[j].y)*(a[i].x-a[k].x);
                   k2 = (a[i].y-a[k].y)*(a[i].x-a[j].x);
                   if(k1!=k2)
                    sm++;
               }
            }
        }
        cout<<sm<<endl;
    }
    return 0;
}