#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<pair<int, int>> p(n);
    for (int i = 0; i < n; ++i) {
        cin >> p[i].first >> p[i].second;
    }

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        ll xi = p[i].first, yi = p[i].second;
        for (int j = i + 1; j < n; ++j) {
            ll dxj = p[j].first - xi;
            ll dyj = p[j].second - yi;
            for (int k = j + 1; k < n; ++k) {
                ll dxk = p[k].first - xi;
                ll dyk = p[k].second - yi;
                ll cross = dxj * dyk - dxk * dyj;
                if (cross < 0) cross = -cross; // absolute value
                ans += cross;
            }
        }
    }

    cout << ans % MOD << endl;

    return 0;
}