#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
using namespace std;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(233);
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
	const int maxn = 131072;
	static char buf[maxn],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
	int res(0);
	char c = getchar();
	while(c < '0') c = getchar();
	while(c >= '0') {
		res = res * 10 + (c - '0');
		c = getchar();
	}
	return res;
}

inline LL fastpo(LL x, LL n, LL mod) {
	LL res(1);
	while(n) {
		if(n & 1) {
			res = res * (LL)x % mod;
		}
		x = x * (LL) x % mod;
		n /= 2;
	}
	return res;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(int x, int width = 0) {
  string res;
  if(x == 0) res.push_back('0');
  while(x) {
    res.push_back('0' + x % 10);
    x /= 10;
  }
  while((int)res.size() < width) res.push_back('0');
  reverse(res.begin(), res.end());
  return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
const int N = 2222;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
struct P {
	LL x, y;
	void scan() {
		cin >> x >> y;
	}
	P operator + (const P & b) const { return P{x + b.x, y + b.y};}
	P operator - (const P & b) const { return P{x - b.x, y - b.y};}
	LL operator * (const P & b) const { return x * b.y - y * b.x;}
	LL operator % (const P & b) const { return x * b.x + y * b.y;}
	bool operator < (const P & b) const {
		int d = x > 0 || x == 0 && y > 0;
		int db = b.x > 0  || b.x == 0 && b.y > 0;
		if(d != db) return d < db;
		else return *this * b > 0;
	}
	void print() const {
		cout << x << ' ' << y << endl;
	}
};
P a[N];
int main() {
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		a[i].scan();
	}
	LL ans = 0;
	for(int i = 0; i < n; i++) {
		P tot{0, 0};
		vector<P> v;
		int cc = 1;
		for(int j = 0; j < n; j++) {
			if(j == i) continue;
			if((a[j] - a[i]).x == 0 && (a[j] - a[i]).y == 0) {
				cc++;
				continue;
			}
			v.pb(a[j] - a[i]);
			tot = tot + v.back();
			
		}
		sort(v.begin(), v.end());
		int sz =  v.size();
		if(sz <= 1) continue;
		int p = 0;
		P sum = v[0];
		LL tmp = 0;
		//printf("%d %d\n", i, cc);
		for(int j = 0, k; j < sz; j = k) {
			/*if(p < j || v[j] * v[p] == 0) {
				while(p + 1 != j + sz && (p + 1 <= j || v[j] * v[(p + 1) % (sz)] == 0)) {
					p = p + 1;
					sum = sum + v[p % (sz)];
				}
			}*/
			P vv{0, 0};
			for(k = j; k < sz && v[j] * v[k] == 0 && v[j] % v[k] > 0; k++) {
				vv = vv + v[k];
			}
			//if(k - j != 1) printf("%d\n", k - j);
			while(j != k - 1) {
				sum = sum - v[j];
				j++;
			}
			while(p + 1 != j + sz && (p < j || v[j] * v[(p + 1) % (sz)] > 0)) {
				p = p + 1;
				sum = sum + v[p % (sz)];
			}
			//cout << '?' << j << ' ' << p << endl;
			//sum.print();
			//v[j].print();
			tmp = tmp + vv * sum % mod - vv * (tot - sum) % mod;
			tmp = (tmp % mod + mod) % mod;
			sum = sum - v[j];
			//cout << "?" << ans << endl;
		}
		//cout << tmp << endl;
		ans = (ans + tmp * (LL)1) %mod;
	}
	ans = ans * fastpo(6, mod - 2, mod) % mod;
	cout << ans << endl;
}