1 #include <stdio.h>
 2 using namespace std;
 3 struct P {
 4     int x,y;
 5 }p[105];
 6 int n;
 7 int f[105][105];
 8 // f i,j 表示凸多边形的最后两个顶点为i,j所构成的最多顶点数
 9 inline void IO() {
10     freopen("polygon.in","r",stdin);
11     freopen("polygon.out","w",stdout);
12 }
13 inline int max(int a,int b) {return a<b?b:a;}
14 inline void swap(P &a, P &b) {
15     int _tem;
16     _tem=a.x, a.x=b.x, b.x=_tem;
17     _tem=a.y, a.y=b.y, b.y=_tem;
18 }
19 inline int cj(P a, P b) {
20     return a.x*b.y-b.x*a.y;
21 }
22
23 inline void RS() {
24     p[0].x=0, p[0].y=0;
25     scanf("%d",&n);
26     for (int i=1;i<=n;++i) scanf("%d %d",&p[i].x,&p[i].y);
27     //按照斜率排序
28     for (int i=1;i<n;++i) for (int j=i+1;j<=n;++j)
29         if (p[i].x*p[j].y < p[j].x*p[i].y)  // y1/x1 > y2/x2
30             swap(p[i],p[j]);
31     for (int i=1;i<=n;++i) f[0][i]=1;
32     for (int i=1;i<=n;++i)
33         for (int j2=i+1;j2<=n+1;++j2)
34             for (int k=0;k<=i-1;++k) {
35                 int j;
36                 P _x, _y; int _tem;
37                 if (j2==n+1) j=0;
38                 else j=j2;
39                 _x.x=p[i].x-p[k].x, _x.y=p[i].y-p[k].y;
40                 _y.x=p[j].x-p[i].x, _y.y=p[j].y-p[i].y;
41                 int c = cj(_y,_x);
42                 if (c<0) f[i][j]=max(f[i][j],f[k][i]+1);
43             }
44     int ans=0;
45     for (int i=0;i<=n;++i)
46         for (int j2=i+1;j2<=n+1;++j2) {
47             int j;
48             if (j2==n+1) j=0; else j=j2;
49             ans = max(ans,f[i][j]);
50         }
51     printf("%d\n",ans);
52 }
53 int main() {
54     IO(),
55     RS();
56     return 0;
57 }