#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(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int 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;};
unordered_map<string,ll> mp;
    
//------ Believe yourself as a genius!!!!!! ------
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n;
    rep(i,n)cin>>a[i];
    rep(i,n){
        char aga;
        for(char c='1';c<='9';c++){
            if((c-'0')==a[i]){
                aga=c;
                break;
            }
        }
        s+=aga;
    }
    queue<string> que;
    que.push(s);
    mp[s]=1;
        while(1){
            if(que.empty())break;
            string co=que.front();
            que.pop();
            cnt=0;
            rep(j,Size(co)){
                if(co[j]=='a')continue;
                tmp=co[j]-'0';
                cnt=__gcd(cnt,tmp);
            }
            if(cnt!=1)continue;
            ans++;
            rep(i,Size(co)){
                string koutiku="";
                rep(j,Size(co)){
                    if(i==j)koutiku+="a";
                    else koutiku+=co[j];
                }
                if(mp[koutiku]==1)continue;
                mp[koutiku]=1;
                que.push(koutiku);
            } 
        }
        Cout(ans);
    return 0;
}