#include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector &vec, int len) { vec.resize(len); } template void ndarray(vector &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template void ndfill(V &x, const T &val) { x = val; } template void ndfill(vector &vec, const T &val) { for (auto &v : vec) ndfill(v, val); } template bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template vector srtunq(vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template istream &operator>>(istream &is, vector &vec) { for (auto &v : vec) is >> v; return is; } template istream &operator>>(istream &is, tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template ostream &operator<<(ostream &os, const vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const tuple &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; } template ostream &operator<<(ostream &os, const deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template ostream &operator<<(ostream &os, const set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const pair &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template ostream &operator<<(ostream &os, const map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl #else #define dbg(x) #endif template struct ModInt { using lint = long long; static int get_mod() { return mod; } static int get_primitive_root() { static int primitive_root = 0; if (!primitive_root) { primitive_root = [&](){ std::set fac; int v = mod - 1; for (lint i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i; if (v > 1) fac.insert(v); for (int g = 1; g < mod; g++) { bool ok = true; for (auto i : fac) if (ModInt(g).power((mod - 1) / i) == 1) { ok = false; break; } if (ok) return g; } return -1; }(); } return primitive_root; } int val; constexpr ModInt() : val(0) {} constexpr ModInt &_setval(lint v) { val = (v >= mod ? v - mod : v); return *this; } constexpr ModInt(lint v) { _setval(v % mod + mod); } explicit operator bool() const { return val != 0; } constexpr ModInt operator+(const ModInt &x) const { return ModInt()._setval((lint)val + x.val); } constexpr ModInt operator-(const ModInt &x) const { return ModInt()._setval((lint)val - x.val + mod); } constexpr ModInt operator*(const ModInt &x) const { return ModInt()._setval((lint)val * x.val % mod); } constexpr ModInt operator/(const ModInt &x) const { return ModInt()._setval((lint)val * x.inv() % mod); } constexpr ModInt operator-() const { return ModInt()._setval(mod - val); } constexpr ModInt &operator+=(const ModInt &x) { return *this = *this + x; } constexpr ModInt &operator-=(const ModInt &x) { return *this = *this - x; } constexpr ModInt &operator*=(const ModInt &x) { return *this = *this * x; } constexpr ModInt &operator/=(const ModInt &x) { return *this = *this / x; } friend constexpr ModInt operator+(lint a, const ModInt &x) { return ModInt()._setval(a % mod + x.val); } friend constexpr ModInt operator-(lint a, const ModInt &x) { return ModInt()._setval(a % mod - x.val + mod); } friend constexpr ModInt operator*(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.val % mod); } friend constexpr ModInt operator/(lint a, const ModInt &x) { return ModInt()._setval(a % mod * x.inv() % mod); } constexpr bool operator==(const ModInt &x) const { return val == x.val; } constexpr bool operator!=(const ModInt &x) const { return val != x.val; } bool operator<(const ModInt &x) const { return val < x.val; } // To use std::map friend std::istream &operator>>(std::istream &is, ModInt &x) { lint t; is >> t; x = ModInt(t); return is; } friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { os << x.val; return os; } constexpr lint power(lint n) const { lint ans = 1, tmp = this->val; while (n) { if (n & 1) ans = ans * tmp % mod; tmp = tmp * tmp % mod; n /= 2; } return ans; } constexpr lint inv() const { return this->power(mod - 2); } constexpr ModInt operator^(lint n) const { return ModInt(this->power(n)); } constexpr ModInt &operator^=(lint n) { return *this = *this ^ n; } inline ModInt fac() const { static std::vector facs; int l0 = facs.size(); if (l0 > this->val) return facs[this->val]; facs.resize(this->val + 1); for (int i = l0; i <= this->val; i++) facs[i] = (i == 0 ? ModInt(1) : facs[i - 1] * ModInt(i)); return facs[this->val]; } ModInt doublefac() const { lint k = (this->val + 1) / 2; if (this->val & 1) return ModInt(k * 2).fac() / ModInt(2).power(k) / ModInt(k).fac(); else return ModInt(k).fac() * ModInt(2).power(k); } ModInt nCr(const ModInt &r) const { if (this->val < r.val) return ModInt(0); return this->fac() / ((*this - r).fac() * r.fac()); } ModInt sqrt() const { if (val == 0) return 0; if (mod == 2) return val; if (power((mod - 1) / 2) != 1) return 0; ModInt b = 1; while (b.power((mod - 1) / 2) == 1) b += 1; int e = 0, m = mod - 1; while (m % 2 == 0) m >>= 1, e++; ModInt x = power((m - 1) / 2), y = (*this) * x * x; x *= (*this); ModInt z = b.power(m); while (y != 1) { int j = 0; ModInt t = y; while (t != 1) j++, t *= t; z = z.power(1LL << (e - j - 1)); x *= z, z *= z, y *= z; e = j; } return ModInt(std::min(x.val, mod - x.val)); } }; using mint = ModInt<1000000007>; // Point on grid, sortable by its argument struct P { constexpr static double eps = 1e-2; long long X, Y; double theta; P() = default; P(long long x, long long y) : X(x), Y(y), theta(std::atan2(y, x)) {} bool operator<(const P &r) const { double b = theta - r.theta; return std::abs(b) > eps ? (b < 0) : (X * r.Y > r.X * Y); } bool operator==(const P &r) const { return std::abs(theta - r.theta) < eps and X * r.Y == r.X * Y; } void rotate_pi() { theta += M_PI; X *= -1; Y *= -1; } }; lint outer(const P &a, const P &b) { return a.X * b.Y - a.Y * b.X; } int main() { int N; cin >> N; vector X(N), Y(N); REP(i, N) cin >> X[i] >> Y[i]; mint ret = 0; REP(t, N) { vector

PS; REP(j, N) if (t != j) { PS.emplace_back(X[j] - X[t], Y[j] - Y[t]); } sort(PS.begin(), PS.end()); REP(i, PS.size()) PS.emplace_back(PS[i]); int l = 0, r = 0; mint xcum = 0, ycum = 0; REP(i, N - 1) { while (r < i + N - 1 and outer(PS[i], PS[r]) >= 0) { xcum += PS[r].X, ycum += PS[r].Y; r++; } xcum -= PS[l].X, ycum -= PS[l].Y; l++; ret += mint(PS[i].X) * ycum - mint(PS[i].Y) * xcum; } } cout << ret / 3 << '\n'; }