/*
Undo the destiny.
*/
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define ll long long
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define pii pair<int,int>
#define mp make_pair

char buf[1 << 20], *p1, *p2;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2)?EOF: *p1++)
template <typename T> inline void read(T &t) {
    int v = getchar();T f = 1;t = 0;
    while (!isdigit(v)) {if (v == '-')f = -1;v = getchar();}
    while (isdigit(v)) {t = t * 10 + v - 48;v = getchar();}
    t *= f;
}
template <typename T,typename... Args> inline void read(T &t,Args&... args) {
    read(t);read(args...);
}

const ll mod = 998244353;
const double eps = 1e-10;
const int N = 2e3 + 10;
int dcmp(double a) {return a < -eps ? -1 : (a > eps ? 1 : 0);}
struct point {
    int x,y;point(int X = 0,int Y = 0) {x = X,y = Y;}
    friend point operator - (const point &a,const point &b) {
        point c;
        c.x = a.x - b.x;
        c.y = a.y - b.y;
        return c;
    } 
    friend int operator ^ (const point &a,const point &b) {
        return a.x * b.y - a.y * b.x;
    } 
}p[N],O;

bool cmp1(point a,point b) {
    return a.x == b.x ? a.y < b.y : a.x < b.x;
}

int convexhull(point *P,int n,int *cp) {
    sort(P+1,P+n+1,cmp1);
    int t = 0;
    for (int i = 1;i <= n;++i) {
        while (t > 1 && dcmp(((P[cp[t]] - P[cp[t-1]]) ^ (P[i] - P[cp[t-1]]))) <= 0) --t;
        cp[++t] = i;
    }
    int st = t;
    for (int i =n-1;i >= 1;--i) {
        while (t > st && dcmp(((P[cp[t]] - P[cp[t-1]]) ^ (P[i] - P[cp[t-1]]))) <= 0) --t;
        cp[++t] = i;
    }
    return --t;
}

int n,cp[N];
bool vis[N];
double theta(point a) {return atan2(a.y,a.x);}
bool lt(double a, double b) { return a - b < -eps; }     // <
void psort(vector <int> &ps, point c)              // 极角排序
{
    sort(ps.begin(), ps.end(), [&](auto p1, auto p2) {
        return lt(theta(p[p1] - c), theta(p[p2] - c));
    });
}
signed main() {
    read(n);
    for (int i = 1;i <= n;++i) read(p[i].x,p[i].y);
    int siz = convexhull(p,n,cp);
    /*
    for (int i = 1;i <= siz;++i) {
        cout << p[cp[i]].x << " " << p[cp[i]].y << endl;
    }
    */
    for (int i = 1;i <= siz;++i) vis[cp[i]] = 1;
    ll ans = 1;
    for (int x = 1;x <= n;++x) {
        if (vis[x]) continue;
        vector <int> qwq;
        for (int i = 1;i <= n;++i) {
            if (i != x) qwq.push_back(i);
        }
        psort(qwq,p[x]);
        int sz = qwq.size();
        if (vis[qwq[0]] && vis[qwq[sz-1]])++ans;
        for (int i = 1;i < sz;++i) {
            if (vis[qwq[i]] && vis[qwq[i-1]])++ans;
        }
    }
    cout <<ans;
    return 0;
}