# Lexical

## 문제

A permutation of a set is a sequence in which every element of the set occurs exactly once. For example, the sequence 3201 is a permutation of the set {0, 1, 2, 3}, where the number 3 appears first, the number 2 appears second, the number 0 appears third and the number 1 appears last in the sequence. We can order the permutations of a set in a “lexicon” by looking at the first position where the permutations are different. For example, the permutation 3201 appears before 3210 in the lexicon, because at the first position where the permutations are different, the first permutation has a 0 whereas the second permutation has a bigger number, namely 1.

Given an integer n (1 ≤ n ≤ 13) and a permutation of the set { 0, 1, 2, …, n – 1 }, determine the position of the permutation in the lexicon.

Example: For n = 4, the lexicon has 24 entries and looks like this:

0123, 0132, 0213, 0231, 0312, 0321, 1023, 1032, 1203, … , 3201, 3210.

The permutation 3 2 0 1 appears at position 23.

The task is to determine at which position a given permutation appears in the lexicon.

Hint: If n is close to 13, it will be too slow to construct the entire lexicon, because the size of the lexicon is 1 × 2 × 3 × ... × n.

## 입력

The input consists of the following two lines:

1. The first line contains an integer indicating the number n.
2. The second line consists of a permutation, namely a sequence of numbers from { 0, 1, 2, …, n – 1 } separated by a space.

## 출력

The output contains a single integer value, which is the position of the permutation in the lexicon.

## 예제 입력 1 복사

    4
    3 2 0 1

## 예제 입력 2 복사

    5
    0 1 2 4 3

## 예제 입력 3 복사

    9
    8 7 5 6 4 0 3 1 2

## 예제 입력 4 복사

    13
    4 0 6 7 2 12 11 8 10 3 1 9 5

## 예제 출력 1 복사

    23

## 예제 출력 2 복사

    2

## 예제 출력 3 복사

    362141

## 예제 출력 4 복사

    1932053504