#include<bits/stdc++.h>
#define fi first
#define se second
using i64 = long long;
struct Point {
    i64 x, y;
    inline Point(i64 x_ = 0, i64 y_ = 0) {x = x_, y = y_;}
};
using Vector = Point;
inline Vector operator + (const Vector &p1, const Vector &p2) {
    return Vector(p1.x + p2.x, p1.y + p2.y);
}
inline Vector operator - (const Vector &p1, const Vector &p2) {
    return Vector(p1.x - p2.x, p1.y - p2.y);
}
inline i64 operator % (const Vector &p1, const Vector &p2) {
    return p1.x * p2.y - p1.y * p2.x;
}
inline long double phi(const Vector &p) {
    return atan2l(p.y, p.x);
}
struct Line {
    Point st, ed;
    inline Line(Point st_, Point ed_) {st = st_, ed = ed_;}
};
using Seg = Line;
inline i64 IsPointOnRight(const Line &l, const Point &p) {
    return (p - l.st) % (l.ed - l.st);
}
const int maxn = 2e3 + 10;
Point a[maxn];
int b[maxn], m;
bool vis[maxn];
std::pair<long double, long double> R[maxn];
int main() {
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%lld%lld", &a[i].x, &a[i].y);
    std::sort(a + 1, a + n + 1, [&](Point x, Point y) {return x.x == y.x ? x.y < y.y : x.x < y.x;});
    for (int i = 1; i <= n; i++) {
        while (m >= 2 && IsPointOnRight(Line(a[b[m - 1]], a[i]), a[b[m]]) < 0) vis[b[m--]] = 0;
        vis[i] = 1, b[++m] = i;
    }
    vis[1] = 0;
    for (int i = n; i; i--) {
        if (vis[i]) continue;
        while (m >= 2 && IsPointOnRight(Line(a[b[m - 1]], a[i]), a[b[m]]) < 0) vis[b[m--]] = 0;
        vis[i] = 1, b[++m] = i;
    }
    if (m == n + 1) return puts("1"), 0;
    int cnt = 1;
    for (int i = 2; i <= m; i++) {
        int K = 0;
        for (int j = 1; j <= n; j++) ! vis[j] && (R[++K] = {phi(a[j] - a[b[i]]), phi(a[j] - a[b[i - 1]])}, 1);
        std::sort(R + 1, R + K + 1, [&](const auto &x, const auto &y) {return x.fi > y.fi;});
        long double mn = R[1].se;
        cnt++;
        for (int j = 2; j <= K; j++) R[j].se <= mn && (mn = R[j].se, cnt++);
    }
    printf("%d\n", cnt);
    return 0;
}