PROGRAMMING:Total permutation with repeating elements
Calculate how many permutations there are for a given number of N, i.e. complete permutation (repeated elements may appear)
###Input format:
The first line inputs the number of numbers n (n > 2), and the second line gives each number.
###Output format:
A number, the number of different arrangements.
###Input example:
```in
three
1 2 2
```
###Output example:
```out
three
```
answer：If there is no answer, please comment
###Input format:
The first line inputs the number of numbers n (n > 2), and the second line gives each number.
###Output format:
A number, the number of different arrangements.
###Input example:
```in
three
1 2 2
```
###Output example:
```out
three
```
answer：If there is no answer, please comment