#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a[ohara],b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k,q;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
map<vector<ll>,ll> mp;
    
//------ Believe yourself as a genius!!!!!! ------

void dfs(ll dat[]){
    vector<ll> now1;
    rep(i,n)now1.p_b(dat[i]);
    if(mp[now1]>=1)return;
    mp[now1]++;
    ll now=0;
    rrep(i,0,n){
        if(dat[i]==LINF)continue;
        now=__gcd(now,dat[i]);
    }
    if(now!=1)return;
    ans++;
    //rep(i,n)cout<<dat[i]<<" ";
    //cout<<"\n";
    rep(i,n){
        ll isao[n+100]={};
        rep(j,n)isao[j]=dat[j];
        if(isao[i]==LINF)continue;
        isao[i]=LINF;
        dfs(isao);
    }
}
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n;
    rep(i,n)cin>>a[i];
    dfs(a);
    Cout(ans);
    return 0;
}