#include<iostream>
#include<queue>
#include<unordered_set>
using namespace std;

#define int long long
const int MOD = 1e9 + 7;
int n, a[11];
queue<int> q;
unordered_set<int> vis;

inline int hs(int *x){
	int res = 0;
	for(int i = 0;i < n;i ++) res = res * 11 + x[i];
	return res;
}

inline void uhs(int h, int *x){
	for(int i = n - 1;i >= 0;i --){
		x[i] = h % 11;
		h /= 11;
	}
}

signed main(){
    freopen("changgao_perm.in", "r", stdin);
    freopen("changgao_perm.out", "w", stdout);
	cin >> n;
	for (int i = 0;i < n;i ++) cin >> a[i];
	int st = hs(a);
	q.push(st); vis.insert(st);
	while(!q.empty()){
		int now = q.front(); q.pop();
//		cout << now << '\n';
		uhs(now, a);
		for(int i = 0;i < n;i ++){
		    for(int j = i + 1;j < n;j ++){
			    if(a[i] > a[j]){
					swap(a[i], a[j]);
					int nxt = hs(a);
//					cout << nxt << '\n';
					if(!vis.count(nxt)){
						vis.insert(nxt);
						q.push(nxt);
					}
					swap(a[i], a[j]);
				}
            }
        }
	}
	cout << (int)(vis.size()) % MOD << '\n';
	return 0;
}