#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll INF = 1LL << 60; template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll n, ll m) { ll tmp; while (m != 0) { tmp = n % m; n = m; m = tmp; } return n; } ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); //gl=xy } using namespace std; template vectordivisor(T n){//約数列挙 vectorv; for(T i=1;i*i<=n;++i){ if(n%i==0){ v.push_back(i); if(i*i!=n)v.push_back(n/i); } } sort(v.begin(),v.end()); return v; } void solve() { int n; cin>>n; vectora(n); rep(i,n)cin>>a[i]; ll ans=0; rep(i,n){ vectorv=divisor(a[i]); vector>dp(n+1,vector(v.size()+5)); ll x=0; dp[i][v.size()-1]=1; REP(j,i,n){ rep(k,v.size()){ x=v[k]; x=gcd(a[j],v[k]); int id=lower_bound(all(v),x)-v.begin(); dp[j+1][id]+=dp[j][k]; if(j!=i)dp[j+1][k]+=dp[j][k]; } } //if(i==0)rep(i,n)cout<