// #pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define sz(x) (int)x.size()
#define bit(a, i) ((a>>i)&1)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int P = 5;
const int K = 110;
const ll inf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 3e5 + 100;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
const string C[] = {"NO\n", "YES\n"};
int n;
int a[20];
bool is[20][20];
vector<int>g[maxn];
ll dp[20][(1<<20)];
bool ok(int x, int y){
if(__builtin_popcount(x) == __builtin_popcount(y)) return 1;
int cnt = 0;
while(x){
if(x%3 == 1) cnt++;
x /= 3;
}
while(y){
if(y%3 == 1) cnt--;
y /= 3;
}
return (cnt == 0);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i=0; i<n; i++){
cin >> a[i];
for(int j=0; j<i; j++){
if(ok(a[i], a[j])){
is[i][j] = is[j][i] = 1;
}
}
dp[i][1<<i] = 1;
}
for(int mask=1; mask<(1<<n); mask++){
vector<int>a, b;
for(int i=0; i<n; i++){
if(bit(mask, i)) a.pb(i);
else b.pb(i);
}
for(int i: a){
for(int to: b){
if(is[i][to]){
dp[to][mask^(1<<to)] += dp[i][mask];
}
}
}
}
ll ans = 0;
for(int i=0; i<n; i++) ans += dp[i][(1<<n)-1];
cout << ans;
}
