#include #include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const ll MOD = 1000000007; //const ll MOD = 998244353; const double pi = 3.14159265358979323846; #define Sp(p) cout< a) { swap(a, b); } if (b == 0) return a; ll r = a%b; while (r != 0) { a = b; b = r; r = a%b; } return b; } signed main() { fio(); int n; cin >> n; vi a(n); rep (i, n) { cin >> a[i]; } vector> dp(n + 1); dp[0][0] = 1; rep (i, n) { for (auto itr = dp[i].begin(); itr != dp[i].end(); itr++) { int g = itr->first; ll num = itr->second; dp[i + 1][g] += num; dp[i + 1][gcd(g, a[i])] += num; } } cout << dp[n][1] << endl; }