#include<bits/stdc++.h>
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define all(v) begin(v),end(v)
using namespace std;
using ll = long long;
bool chmin(auto &a, auto b){ return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, auto b){ return a < b ? a = b, 1 : 0; }

using pli = pair<ll,int>;
using pii = pair<int,int>;

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    const char* delim = "";
    for (auto &e : v){
        os << exchange(delim, " ") << e;
    }
    return os;
}

struct vec {
    ll x, y;
    vec (ll _x = 0, ll _y = 0) : x(_x), y(_y) {}
    vec &operator-=(vec a){
        x -= a.x;
        y -= a.y;
        return *this;
    }
    friend vec operator-(vec a, vec b){
        return a -= b;
    }
    friend ll cross(vec a, vec b){
        return a.x*b.y - a.y*b.x;
    }
    friend int ccw(vec a, vec b, vec c){
        return cross(b-a,c-b) > 0 ? 1 : -1;
    }
    friend int orth(vec a){
        if (a.x > 0 && a.y >= 0) return 0;
        if (a.x <= 0 && a.y > 0) return 1;
        if (a.x < 0 && a.y <= 0) return 2;
        if (a.x >= 0 && a.y < 0) return 3;
        abort();
        return 4;
    }
};

void solve(){
    int n; cin >> n;
    vector<vec> a(n);
    rep(i,0,n){
        cin >> a[i].x >> a[i].y;
    }
    vector<vector<int>> b(n);
    rep(i,0,n){
        vector<int> ids(n); iota(all(ids),0);
        ids.erase(ids.begin()+i);
        sort(all(ids),[&](int l, int r){
            int lo = orth(a[l] - a[i]);
            int ro = orth(a[r] - a[i]);
            if (lo == ro){
                return ccw(a[i],a[l],a[r]) == 1;
            }
            return lo < ro;
        });
        b[i] = ids;
    }
    auto order = [&](int i, int j) -> vector<int> {
        // ccw(a[i],a[j],a[k]) == 1
        auto upper = [&](int k){
            if (k == i || k == j) return false;
            return ccw(a[i],a[j],a[k]) == 1;
        };
        vector<int> ui, uj;
        {
            int pos = -1;
            for (int p = 0; int k : b[i]){
                if (k == j){
                    pos = p;
                    break;
                }
                p++;
            }
            rep(id,pos+1,n-1){
                if (upper(b[i][id])){
                    ui.emplace_back(b[i][id]);
                }
            }
            rep(id,0,pos){
                if (upper(b[i][id])){
                    ui.emplace_back(b[i][id]);
                }
            }
        }
        {
            int pos = -1;
            for (int p = 0; int k : b[j]){
                if (k == i){
                    pos = p;
                    break;
                }
                p++;
            }
            rep(id,pos+1,n-1){
                if (upper(b[j][id])){
                    uj.emplace_back(b[j][id]);
                }
            }
            rep(id,0,pos){
                if (upper(b[j][id])){
                    uj.emplace_back(b[j][id]);
                }
            }
        }
        assert(ssize(ui) == ssize(uj));
        vector<int> uiinv(n);
        rep(id,0,ssize(ui)){
            uiinv[ui[id]] = id;
        }
        vector<int> uok;
        int ordmin = 1e9;
        for (int p : uj | views::reverse){
            if (ordmin > uiinv[p]){
                uok.emplace_back(p);
            }
            chmin(ordmin,uiinv[p]);
        }
        reverse(all(uok));
        return uok;
    };
    ll ans = 0;
    rep(i,0,n) rep(j,i+1,n){
        vector<int> uok = order(i,j);
        vector<int> dok = order(j,i);
        int sz = uok.size();
        int r = 0;
        int l = 0;
        for (int p : dok){
            while (l < sz && ccw(a[p],a[j],a[uok[l]]) == -1){
                l++;
            }
            while (r < sz && ccw(a[p],a[i],a[uok[r]]) == -1){
                r++;
            }
            ans += r-l;
            ans += (sz - (r-l)) * 2;
        }
    }
    assert(ans % 2 == 0);
    ans /= 2;
    cout << ans << endl;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    solve();
}