### Painting Cottages

Time Limit: 2000 ms Memory Limit: 65536 KiB

#### Problem Description

The new cottage settlement is organized near the capital of Flatland. The construction company that is building the settlement has decided to paint some cottages pink and others — light blue. However, they cannot decide which cottages must be painted which color. The director of the company claims that the painting is nice if there is at least one pink cottage, at least one light blue cottage, and it is possible to draw a straight line in such a way that pink cottages are at one side of the line, and light blue cottages are at the other side of the line (and no cottage is on the line itself). The main architect objects that there are several possible nice paintings. Help them to ﬁnd out how many diﬀerent nice paintings are there.

#### Input

The ﬁrst line of the input ﬁle contains n — the number of the cottages (1 ≤ n ≤ 300). The following n lines contain the coordinates of the cottages — each line contains two integer numbers xi and yi (−10^4 ≤ xi, yi ≤ 10^4).

#### Output

Output one integer number — the number of diﬀerent nice paintings of the cottages.

#### Sample Input

4
0 0
1 0
1 1
0 1

#### Sample Output

12

Sample.

#### Source

2014年山东省第五届ACM大学生程序设计竞赛