#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
typedef pair<int,int> PII;
const int MX=2020;

int N, cnt;
bool ins[MX];
bool vis[MX][MX];
struct point;
int qua(point p);
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct point
{
    int x, y; int id;
    point operator - (const point &a)const {return {x-a.x,y-a.y,id};}
    point operator + (const point &a)const {return {x+a.x,y+a.y,id};}
    int operator ^ (const point &a)const {return x*a.y-y*a.x;}
}p[MX], np[MX], s1[MX], pd;
int qua(point p)
{
    if(p.x>=0&&p.y<0) return 1; 
    if(p.x>0&&p.y>=0) return 2;
    if(p.x<=0&&p.y>0) return 3;
    if(p.x<0&&p.y<=0) return 4;
    return 5;
}
bool cmp(point a, point b)
{
    if(qua(a-pd)!=qua(b-pd)) return qua(a-pd)<qua(b-pd);
    else return ((a-pd)^(b-pd))>0;
}
int t1;
int main()

{
    // freopen("testdata.in","r",stdin);
    N=read(); int id=1;
    for(int i=1;i<=N;i++)
    {
        scanf("%d%d",&p[i].x,&p[i].y); 
        p[i].id=i;
        if(p[i].x<p[id].x||(p[i].x==p[id].x&&p[i].y<p[id].y)) id=i;
    }   
    swap(p[1],p[id]); pd=p[1];
    sort(p+2,p+1+N,cmp);
    s1[++t1]=p[1];
    for(int i=2;i<=N;i++)
    {
        while(t1>=2&&((s1[t1]-s1[t1-1])^(p[i]-s1[t1]))<=0) t1--;
        s1[++t1]=p[i];
    }  
    for(int i=1;i<=t1;i++) ins[s1[i].id]=1;
    s1[++t1]=p[1];
    for(int i=1;i<t1;i++) vis[s1[i].id][s1[i+1].id]=1; 
    int ans=0;
    memcpy(np,p,sizeof(p));
    for(int i=1;i<=N;i++)
    {
        int id=np[i].id;
        if(ins[id]) continue;
        pd=np[i];
        sort(p+1,p+1+N,cmp);
        p[N+1]=p[1];
        for(int j=1;j<=N;j++)
        {
            int nxt=(p[j+1].id==id)?p[j+2].id:p[j+1].id;
            ans+=vis[p[j].id][nxt];
        }
    }
    cout << ans+1 << '\n';
    return (0-0);
}