#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define OO 2'000'000'000
#define ull unsigned long long
#define nl '\n'
#define sz(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>


void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin);
// freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}




int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };

const ll MOD = 1e9+7;

int n;
vector<ll> v;

bool check(vector<ll>& a) {
    for(int i = 0; i < n-1; i++) {
        if(a[i] % a[i+1] != 0 && a[i+1] % a[i] != 0) {
            return false;
        }
    }
    return true;
}

ll count_permutations(int i) {
    if(i == n) {
        return check(v);
    }
    ll cnt = 0;
    for(int j = i; j < n; j++) {
        swap(v[i], v[j]);
        cnt += count_permutations(i+1);
        swap(v[i], v[j]);
    }
    return cnt;
}


void solve(){

 cin >> n;
    v.resize(n);
    for(auto& i : v) cin >> i;

    cout << count_permutations(0) << nl;




}

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}