#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

constexpr ll mod = 1e9+7;
struct mint {
    ll x;
    mint(ll x=0):x((x%mod+mod)%mod){}
    
    friend ostream &operator<<(ostream& os,const mint& a){
        return os << a.x;
    }

    friend istream &operator>>(istream& is,mint& a){
        ll t;
        is >> t;
        a = mint(t);
        return (is);
    }

    mint& operator+=(const mint a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += mod-a.x) >= mod) x -= mod;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    // for prime mod
    mint inv() const {
        return pow(mod-2);
    }
    mint& operator/=(const mint a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint a) const {
        mint res(*this);
        return res/=a;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    map<pair<int,int>,int> mp;
    for(int i=0;i<N;i++){
        int x,y;
        cin >> x >> y;
        mp[{x,y}]++;
    }
    N = mp.size();
    vec<int> X(N),Y(N);
    vec<mint> Z(N);
    int c = 0;
    for(auto& x:mp){
        X[c] = x.first.first;
        Y[c] = x.first.second;
        Z[c] = x.second;
        c++;
    }
    assert(c==N);
    mint ans = 0;

    auto solve = [&](vec<ll> A,vec<ll> B,vec<mint> C,mint cnt){
        int N = A.size();
        vec<int> idx(N);
        iota(idx.begin(),idx.end(),0);
        
        auto shogen = [](int x,int y){
            if(x<=0 && y<0) return 0;
            if(x>0 && y<=0) return 1;
            if(x>=0 && y>0) return 2;
            else return 3;
        };
        
        sort(idx.begin(),idx.end(),[&](int i,int j){
            int a = shogen(A[i],B[i]),b = shogen(A[j],B[j]);
            if(a!=b) return a<b;
            else return A[i] * B[j] > A[j] * B[i];
        });
        auto cross = [&](int i,int j){
            return A[i] * B[j] > A[j] * B[i];
        };
        mint sx = 0,sy = 0;
        int r = 0;
        for(int l=0;l<N;l++){
            if(l==r) r = (l+1)%N;
            while(r!=l && cross(idx[l],idx[r])){
                sx += C[idx[r]]*A[idx[r]];
                sy += C[idx[r]]*B[idx[r]];
                (r += 1)%=N;
            }
            ans += (sy*A[idx[l]]*C[idx[l]]-sx*B[idx[l]]*C[idx[l]])*cnt;
            if(l!=N-1 && r!=(l+1)%N) sy -= C[idx[l+1]]*B[idx[l+1]],sx -= C[idx[l+1]]*A[idx[l+1]];
        }
    };

    for(int i=0;i<N;i++){
        vec<ll> A,B;
        vec<mint> C;
        for(int j=0;j<N;j++) if(i!=j){
            A.push_back(X[j]-X[i]);
            B.push_back(Y[j]-Y[i]);
            C.push_back(Z[j]);
        }
        solve(A,B,C,Z[i]);
    }

    cout << ans/3 << "\n";
}