import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] p = new int[n];
		for (int i = 0; i < n; ++i) {
			p[i] = sc.nextInt();
		}
		BigInteger fac = BigInteger.valueOf(1);
		BIT bit = new BIT(n + 1);
		for (int i = 1; i <= n; ++i) {
			bit.add(i, 1);
		}

		int[] coe = new int[n];
		BigInteger ans = BigInteger.ZERO;
		for (int i = 0; i < n; ++i) {
			int v = bit.sum(1, p[i]);
			coe[i] = v;
			// fac = fac.divide(BigInteger.valueOf(n - i));
			// ans = ans.add(fac.multiply(BigInteger.valueOf(v)));
			bit.add(p[i], -1);
		}
		for (int i = n - 1; i >= 0; --i) {
			ans = ans.add(fac.multiply(BigInteger.valueOf(coe[i])));
			fac = fac.multiply(BigInteger.valueOf(n-i));
		}
		ans = ans.add(BigInteger.ONE);
		System.out.println(ans);

	}

	class BIT {
		int n;
		int[] a;

		public BIT(int n_) {
			n = n_;
			a = new int[n + 1];
		}

		void add(int k, int add) {
			++k;
			while (k < a.length) {
				a[k] += add;
				k += k & -k;
			}
		}

		int sum(int k) {
			++k;
			int ret = 0;
			while (k > 0) {
				ret += a[k];
				k -= k & -k;
			}
			return ret;
		}

		int sum(int a, int b) {
			return sum(b - 1) - sum(a - 1);
		}
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}