#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC target ("avx2")
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma comment (linker, "/STACK: 16777216")
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
using namespace __gnu_pbds;
template <typename T> inline bool umax(T &a, const T &b) { if(a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool umin(T &a, const T &b) { if(a > b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 998244353;
const ll base = 1e6 + 5;
const ll inf = 1e12;
const int MAX = 2e5 + 5;
const int LG = 20;
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<ll> dis(1, inf);
void solve() {
int n;
cin >> n;
vector<int> a(n);
for(auto &i : a) {
cin >> i;
}
vector<int> bin(n), ter(n);
for(int i = 0; i < n; i++) {
bin[i] = __builtin_popcount(a[i]);
int x = a[i];
while(x) {
ter[i] += (x % 3 == 1);
x /= 3;
}
}
vector<vector<int>> go(n);
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(bin[i] == bin[j] || ter[i] == ter[j]) go[i].pb(j);
}
}
vector<vector<int>> dp((1 << n), vector<int>(n));
for(int i = 0; i < n; i++) dp[1 << i][i] = 1;
for(int mask = 1; mask < (1 << n); mask++) {
for(int lst = 0; lst < n; lst++) {
if(!dp[mask][lst]) continue;
for(auto i : go[lst]) {
if(mask >> i & 1) continue;
dp[mask | (1 << i)][i] += dp[mask][lst];
}
}
}
int ans = accumulate(all(dp[(1 << n) - 1]), 0LL);
cout << ans << '\n';
}
signed main() {
// freopen("skyline.in", "r", stdin); freopen("skyline.out", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ttt = 1;
// cin >> ttt;
while(ttt--) {
solve();
}
return 0;
}
