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

public class Sol {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = scanner.nextInt();
        }

        BinaryIndexedTree ft = new BinaryIndexedTree(n);

        long[] factSum = new long[n];

        for (int i = 0; i < n - 1; i++) {
            int a = A[i];
            int cnt = a-1-ft.sum(a);
            int len = n - i;
            factSum[len-1] += cnt;
            ft.add(a, 1);
        }
//        System.out.println(Arrays.toString(factSum));

        BigInteger ans = BigInteger.ONE;
        BigInteger fact = BigInteger.ONE;

        for (int i = 1; i < n; i++) {
            fact = fact.multiply(BigInteger.valueOf(i));
            if (factSum[i] > 0) {
                ans = ans.add(fact.multiply(BigInteger.valueOf(factSum[i])));
            }
        }

        System.out.println(ans);
    }
}

class BinaryIndexedTree {
    private int n;
    private int[] val;

    public BinaryIndexedTree(int n) {
        this.n = n;
        val = new int[n];
    }

    public void add(int i, int x) {
        for (; i < n; i |= i + 1) val[i] += x;
    }

    int sum(int i) {
        int s = 0;
        --i;
        if (i >= n) i = n - 1;
        for (; i >= 0; i = (i & (i + 1)) - 1) s += val[i];
        return s;
    }
}