#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
long long n;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void pro(vector<long long> &a, long long b) {
  for (int i = 0; i < a.size(); i++) {
    a[i] = a[i] * b;
  }
  for (int i = 0; i < a.size() - 1; i++) {
    a[i + 1] += a[i] / 10;
    a[i] %= 10;
  }
  int last = a[a.size() - 1];
  a.pop_back();
  while (last) {
    a.push_back(last % 10);
    last /= 10;
  }
}
int main() {
  scanf("%lld", &n);
  vector<long long> ans;
  ans.push_back(1);
  long long t = 120;
  for (long long i = n - 4; i <= n; i++) {
    long long d = i;
    pro(ans, d);
    long long gcdd = gcd(t, d);
    t /= gcdd, d /= gcdd;
    pro(ans, d);
  }
  for (int i = ans.size() - 1; i >= 0; i--) {
    printf("%lld", ans[i]);
  }
  return 0;
}
