#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

bool comp(pair<ll,ll> l,pair<ll,ll> r){
	if(l.first==0&&r.first==0) return l.second>r.second;
	if(l.first==0){
		return l.second>0||r.first<0;
	}
	if(r.first==0){
		return r.second>0||l.first<0;
	}
	if((l.first<0)^(r.first<0)) return l.first>0;
	return l.first*r.second<l.second*r.first;
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<ll> X(N),Y(N);ll ans=0;
	rep(i,N) cin>>X[i]>>Y[i];
	rep(roop,N){
		vector<pair<ll,ll>> point;
		rep(i,N){
			if(X[i]==X[roop]&&Y[i]==Y[roop]) continue;
			point.push_back({X[i]-X[roop],Y[i]-Y[roop]});
		}
		int M=point.size();
		vector<int> order(M*2);
		rep(i,M*2) order[i]=i;
		sort(all(order),[&](int L,int R){
			auto l=point[L%M],r=point[R%M];
			if(L>=M) l.first*=-1,l.second*=-1;
			if(R>=M) r.first*=-1,r.second*=-1;
			if(l==r) return L<R;
			if(l.first==0&&r.first==0){
				return l.second>r.second;
			}
			if(l.first==0){
				return (l.second>0||r.first<0);
			}
			if(r.first==0){
				return !(r.second>0||l.first<0);
			}
			if((l.first<0)^(r.first<0)){
				return l.first>0;
			}
			return l.first*r.second<l.second*r.first;
		});
		rep(i,M) point.push_back(point[i]);
		ll x_sum=0,y_sum=0;
		rep(i,M){
			if(point[i].first>0||(point[i].first==0&&point[i].second>0)){
				x_sum-=point[i].first;
				y_sum-=point[i].second;
			}else{
				x_sum+=point[i].first;
				y_sum+=point[i].second;
			}
		}
		rep(i,M*2){
			int a=order[i];
			if(a>=M){
				a-=M;
				x_sum-=point[a].first*2ll;
				y_sum-=point[a].second*2ll;
				continue;
			}
			x_sum+=point[a].first*2ll;
			y_sum+=point[a].second*2ll;
			x_sum%=mod;
			y_sum%=mod;
			ans=(ans+(y_sum*point[a].first)%mod)%mod;
			ans=(ans-(x_sum*point[a].second)%mod)%mod;
			//cout<<ans<<endl;
		}
		//rep(i,M) cout<<point[i].first<<" "<<point[i].second<<endl;
	}
	cout<<(((ans)*((mod+1)/6))%mod+mod)%mod<<"\n";
}