#include <bits/stdc++.h>
using namespace std;

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#else
#endif
#define int long long
#define sz(v) ((int)(v).size())
#define MAX(x, y) (x = max((x), (y)))
#define pi array<int, 2>
#define all(v) (v).begin(), (v).end()

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    vector<pi> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i][0] >> a[i][1];
    }

    auto ccw = [&](pi x, pi y, pi z){
        y[0] -= x[0], y[1] -= x[1];
        z[0] -= x[0], z[1] -= x[1];

        int v = y[0] * z[1] - y[1] * z[0];

        return v ? v > 0 ? 1 : -1 : 0;
    };

    vector<vector<int>> id(n, vector<int>(n, -1));
    vector<vector<int>> srt(n);
    for(int i = 0; i < n; ++i){
        vector<int> su, sd;
        for(int j = 0; j < n; ++j){
            if(i == j) continue;
            if(a[i][1] <= a[j][1]) su.push_back(j);
            else sd.push_back(j);
        }

        sort(all(su), [&](int x, int y){return ccw(a[i], a[x], a[y]) > 0;});
        sort(all(sd), [&](int x, int y){return ccw(a[i], a[x], a[y]) > 0;});
        for(auto&v:sd) su.push_back(v);
        srt[i] = su;

        for(int j = 0; j < sz(su); ++j){
            id[i][su[j]] = j;
        }
    }

    auto in = [&](int x, int y, int z){
        if(x > y) y += n - 1;
        if(x > z) z += n - 1;
        return z >= x && z < y;
    };

    int ans = 0;
    vector<int> ok(n, -1);
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            pi cnt = {0, 0};

            int cut = 1;
            while(cut < n - 1 && ccw(a[i], a[j], a[srt[i][(id[i][j] + cut) % (n - 1)]]) > 0) ++cut;

            int mx = -1;
            for(int k = 0; k < n; ++k) ok[k] = -1;
            for(int k = 1; k < cut; ++k){
                int now = srt[i][(id[i][j] + k) % (n - 1)];
                if(mx == -1 || in(mx, id[j][i], id[j][now])){
                    ok[now] = 0;
                    mx = id[j][now];
                    ++cnt[0];
                }
            }

            int mn = -1;
            for(int k = n - 2; k >= cut; --k){
                int now = srt[i][(id[i][j] + k) % (n - 1)];
                if(mn == -1 || in(id[j][i], mn, id[j][now])){
                    ok[now] = 1;
                    mn = id[j][now];
                    ++cnt[1];
                }
            }

            ans += cnt[0] * cnt[1];
            
            auto sol = [&](int st, int ed){
                pi ncnt = {0, 0};
                for(int i = 0, j = 0; i < n - 1; ++i){
                    int ni = srt[st][(id[st][ed] + i) % (n - 1)];
                    while(j < n - 1){
                        int nj = srt[st][(id[st][ed] + j) % (n - 1)];
                        if(ccw(a[st], a[ni], a[nj]) < 0) break;
                        if(ok[nj] != -1) ++ncnt[ok[nj]];
                        ++j;
                    }
                    if(ok[ni] != -1){
                        ans += ncnt[1 - ok[ni]];
                        --ncnt[ok[ni]];
                    }

                    // cout << st << ' ' << srt[st][i] << ' ' << srt[st][j] << ' ' << ncnt[0] << ' ' << ncnt[1] << endl;
                }
            };
            sol(i, j), sol(j, i);

            // cout << i << ' ' << j << ' ' << cut << endl;
            // for(int k = 0; k < n; ++k) cout << ok[k] << ' ';
            // cout << endl;
            // cout << ans << endl;
        }
    }

    assert(ans % 2 == 0);
    cout << ans / 2;

    return 0;
}