#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

struct V{
	int x,y;
	bool operator< (const V &v) const {
		return x * v.y > v.x * y;
	}
	bool operator== (const V &v) const {
		return x == v.x && y == v.y;
	}
};

ll modpow(ll x, ll n, ll mod){
	ll res = 1;
	while(n > 0){
		if(n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

int main(){
	int n; cin >> n;
	vector<V> v(n);
	rep(i,n) cin >> v[i].x >> v[i].y;
	ll ans = 0;
	rep(i,n){
		vector<V> vs;
		rep(j,n){
			if(v[i] == v[j]) continue;
			V pu;
			pu.x = v[j].x - v[i].x;
			pu.y = v[j].y - v[i].y;
			if(pu.y < eps){
				pu.x = -pu.x;
				pu.y = -pu.y;
			}
			vs.emplace_back(pu);  
		}
		sort(all(vs));
		int X = 0, Y = 0;
		int m = vs.size();
		//for(auto j : vs) print2(j.x, j.y);
		rep(j,m){
			ans += X * vs[j].y - Y * vs[j].x;
			X += vs[j].x;
			Y += vs[j].y;
		}
		ans %= mod;
		//cout << ans << "\n";
	}
	ans *= modpow(3,mod-2,mod);
	ans %= mod;
	cout << ans << "\n";
}