#include <bits/stdc++.h>
using namespace std;

// one-based numbering
struct Fenwick {
    vector<int> bit; int N;
    Fenwick(int n) {
      N = n;
      bit.resize(n+1, 0);
    }
    void add(int a, int w) {
      for (int x = a; x <= N; x += x & -x) bit[x] += w;
    }
    int sum(int a) {
      int ret = 0;
      for (int x = a; x > 0; x -= x & -x) ret += bit[x];
      return ret;
    }
};

struct solve {
  vector<int> ans;
  long long digit;
  solve(int n) {
    ans.push_back(n);
    digit = 1000000000;
  }
  void mul(int c){
    long long pool = 0;
    for (int i = 0; i < (int) ans.size(); i++) {
      long long s = (long long) ans[i] * c + pool;
      pool = s / digit;
      ans[i] = s % digit;
    }
    if (pool > 0) ans.push_back(pool);
  }

  vector<int> vmul(int c){
    vector<int> ret;
    long long pool = 0;
    for (int i = 0; i < (int) ans.size(); i++) {
      long long s = (long long) ans[i] * c + pool;
      pool = s / digit;
      ret.push_back(s % digit);
    }
    if (pool > 0) ret.push_back(pool);
    return ret;
  }

  void add(vector<int> ad) {
    if (ans.size() < ad.size()) swap(ans, ad);
    long long pool = 0;
    for (int i = 0; i < (int) ad.size(); i++) {
      long long s = ans[i] + ad[i] + pool;
      pool = s / digit;
      ans[i] = s % digit;
    }
    if (pool > 0) {
      int t = ad.size();
      while (pool > 0) {
        if (t < ans.size()) {
          long long s = ans[t] + pool;
          pool = s / digit;
          ans[t] = s % digit;
        } else {
          ans.push_back(pool);
        }
      }
    }
  }

  void output() {
    for (int i = (int) ans.size() - 1; i >= 0; i--) {
      if (i == (int) ans.size() - 1) printf("%d", ans[i]);
      else printf("%9d", ans[i]);
    }
    cout << endl;
  }
};

int main(){
  int n; cin >> n;
  Fenwick f = Fenwick(n);
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    int k; cin >> k;
    f.add(k, 1);
    v[n-1-i] = k - f.sum(k);
  }
  /*
  for (int i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  */
  struct solve frac = solve(1);
  struct solve ans = solve(1);
  for (int i = 1; i < n; i++) {
    ans.add(frac.vmul(v[i]));
    frac.mul(i+1);
  }
  ans.output();
  return 0;
}