#include using namespace std; //#include //using multiInt = boost::multiprecision::cpp_int; using ll = long long int; using ld = long double; using pii = pair; using pll = pair; template using smaller_queue = priority_queue, greater>; const int MOD_TYPE = 1; const ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353); const int INF = (int)1e9; const ll LINF = (ll)4e18; const ld DINF = 1e12; const ld PI = acos(-1.0); const ld EPS = 1e-11; #define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i) #define rep(i, n) REP(i, 0, n) #define MP make_pair #define MT make_tuple #define YES(n) cout << ((n) ? "YES" : "NO") << "\n" #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl #define possible(n) cout << ((n) ? "possible" : "impossible") << endl #define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl #define all(v) v.begin(), v.end() #define NP(v) next_permutation(all(v)) #define dbg(x) cerr << #x << ":" << x << endl; vector Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0}; vector Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0}; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << setprecision(30) << setiosflags(ios::fixed); ll n; cin >> n; ll a[50]; rep(i, n) cin >> a[i]; set search; search.insert(0); rep(i, n) { for (ll j = 1; j * j <= a[i]; j++) { if (a[i] % j != 0) continue; search.insert(j); search.insert(a[i] / j); } } map dp[51]; dp[0][0] = 1; rep(i, n) { for (auto t : search) { dp[i + 1][t] += dp[i][t]; dp[i + 1][__gcd(t, a[i])] += dp[i][t]; } } cout << dp[n][1] << endl; return 0; }