#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define PI 3.141592653589793238
#define eps 1e-12
#define mod 1000000007

using namespace std;
typedef pair<double, llint> P;

llint n;
llint x[2005], y[2005];
vector<P> vec;

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
	
	llint ans = 0;
	for(int i = 1; i <= n; i++){
		vec.clear();
		for(int j = 1; j <= n; j++){
			if(i == j) continue;
			vec.push_back(P(atan2(y[j]-y[i], x[j]-x[i]), j));
		}
		sort(vec.begin(), vec.end());
		
		for(int j = 0; j < n-1; j++){
			vec.push_back(vec[j]);
			vec.back().first += 2 * PI;
		}
		llint l = 0, r = 0;
		for(int j = 0; j < n-1; j++){
			double ang = vec[j].first;
			llint id = vec[j].second;
			while(vec[l+1].first <= ang+eps) l++;
			while(vec[r+1].first < ang+PI-eps) r++;
			llint tmp = (x[i]*y[id]%mod + mod - x[id]*y[i]%mod) % mod;
			tmp *= r-l, tmp %= mod;
			ans += tmp, ans %= mod;
		}
	}
	cout << ans << endl;
	
	return 0;
}