#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }

constexpr Int MO = 1'000'000'007;
constexpr int MAX_N = 2005;

int N;
int X[MAX_N], Y[MAX_N];

int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%d%d", &X[i], &Y[i]);
  }
  Int ans = 0;
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      X[j] -= X[i];
      Y[j] -= Y[i];
    }
    for (int j = i + 1; j < N; ++j) {
      const int a = X[j], b = Y[j];
      Int sum = 0;
      for (int k = j + 1; k < N; ++k) {
        const Int det = a * Y[k] - b * X[k];
        sum += (det < 0) ? -det : det;
      }
      ans += sum;
    }
  }
  if ((ans %= MO) < 0) {
    ans += MO;
  }
  printf("%lld\n", ans);
  return 0;
}