#include <cassert>
#include <algorithm>
#include <vector>
#include <numeric>
#include <iostream>
using namespace std;

using P = pair<int, int>;

long long cp(P p, P q) {
    return (long long)p.first * q.second - (long long)p.second * q.first;
}
long long ip(P p, P q) {
    return (long long)p.first * q.first + (long long)p.second * q.second;
}
P operator+(P p, P q) { return { p.first + q.first, p.second + q.second}; }
P operator-(P p, P q) { return { p.first - q.first, p.second - q.second}; }

bool par(P p, P q) {
    return cp(p, q) == 0 && ip(p, q) > 0;
}

const int M = 1000000007;

int main() {
    int n; cin >> n;
    P p[n]; for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        vector<P> q;
        for (int j = 0; j < n; j++) if (p[i] != p[j]) q.push_back(p[j] - p[i]);
        sort(q.begin(), q.end(), [](P p, P q) {
                if (p == q) return false;
                auto [a, b] = p;
                auto [c, d] = q;
                if (b > 0) {
                    if (d < 0) return true;
                    else if (d == 0) return c < 0;
                    else return cp(p, q) > 0;
                } else if (b == 0) {
                    if (a > 0) return true;
                    else return d < 0;
                } else {
                    if (d >= 0) return false;
                    else return cp(p, q) > 0;
                }
            });
        if (q.empty() || q.front() == q.back()) continue;
        // cerr << "center = " << p[i].first << " " << p[i].second << endl;
        // for (P x : q) cerr << "(" << x.first << ", " << x.second << "); "; cerr << endl;
        P S = {0, 0};
        const int m = q.size();
        for (int i = 0; i < m; i++) q.push_back(q[i]);
        for (int i = 0, j = 0; i < m; i++) {
            if (i == j) while (j < i + m && par(q[i], q[j])) { S = S + q[j]; j++; }
            while (j < i + m && cp(q[i], q[j]) > 0) {
                S = S + q[j];
                j++;
            }
            ans += cp(q[i], S);
            // cerr << "S = " << S.first << " " << S.second << endl;
            // cerr << "q[i] = " << q[i].first << " " << q[i].second << ' ' << i << endl;
            // cerr << "q[j] = " << q[j].first << " " << q[j].second << ' ' << j << endl;
            // cerr << "area = " << cp(q[i], S) << endl;
            S = S - q[i];
        }
        // cerr << ans % M << endl;
    }
    cout << ans % M * 333333336 % M << endl;
}