#include 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)< #define m_p make_pair #define V vector #define U_MAP unordered_map #define pq priority_queue #define rpq priority_queue,greater> #define p_b push_back ll n,cnt,ans,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,ll> mp; V a; //------ 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>>tmp; a.p_b(tmp); } queue> que; que.push(a); mp[a]=1; while(1){ if(que.empty())break; vector co=que.front(); que.pop(); cnt=0; rep(j,Size(co)){ if(co[j]==LINF)continue; tmp=co[j]; cnt=__gcd(cnt,tmp); } //Cout(co); //rep(i,Size(co))cout< koutiku; rep(j,Size(co)){ if(i==j)koutiku.p_b(LINF); else koutiku.p_b(co[j]); } if(mp[koutiku]==1)continue; mp[koutiku]=1; que.push(koutiku); } } Cout(ans); return 0; }