#define _USE_MATH_DEFINES #define _CRT_SECURE_NO_WARNINGS #include "bits/stdc++.h" #define rep(i, n) for (int i = 0; i < (n); ++i) #define FOR(i, m, n) for (int i = (m); i < (n); ++i) #define rrep(i, n) for (int i = (n) - 1; i >= 0; --i) #define rfor(i, m, n) for (int i = (m); i >= (n); --i) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r) using namespace std; using ll = long long; using ld = long double; using VB = vector; using VVB = vector; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using VS = vector; using VD = vector; using PII = pair; using VP = vector; using PLL = pair; using VPL = vector; templateusing PQ = priority_queue; templateusing PQS = priority_queue, greater>; constexpr int inf = (int)1e9; constexpr ll inf_ll = (ll)1e18, MOD = 1000000007; constexpr ld PI = M_PI, EPS = 1e-12; // --- input --- // #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #define fwrite_unlocked fwrite #define fflush_unlocked _fflush_nolock #endif inline int gc() { return getchar_unlocked(); } templateinline void InputF(T& v) { cin >> v; } inline void InputF(char& v) { while (isspace(v = gc())); } inline void InputF(bool& v) { char c; InputF(c); v = c == '1'; } inline void InputF(string& v) { char c; for (InputF(c); !isspace(c); c = gc())v += c; } inline void InputF(int& v) { bool neg = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc())v = v * 10 + (c - '0'); if (neg)v = -v; } inline void InputF(long long& v) { bool neg = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c); c = gc())v = v * 10 + (c - '0'); if (neg)v = -v; } inline void InputF(double& v) { double dp = 1; bool neg = false, adp = false; v = 0; char c; InputF(c); if (c == '-') { neg = true; c = gc(); } for (; isdigit(c) || c == '.'; c = gc()) { if (c == '.')adp = true; else if (adp)v += (c - '0') * (dp *= 0.1); else v = v * 10 + (c - '0'); } if (neg)v = -v; } templateinline void InputF(pair& v) { InputF(v.first); InputF(v.second); } templateinline void InputF(vector& v) { for (auto& e : v)InputF(e); } templateinline void InputTuple(T& v) { if constexpr (N < tuple_size_v) { InputF(get(v)); InputTuple(v); } } templateinline void InputF(tuple& v) { InputTuple(v); } templateinline T InputF() { T v; InputF(v); return v; } struct InputV { int n, m; InputV(int N) :n(N), m(0) {} InputV(pair N) :n(N.first), m(N.second) {} templateoperator vector() { vector v(n); InputF(v); return v; } templateoperator vector>() { vector> v(n, vector(m)); InputF(v); return v; } }; struct Input { templateoperator T() { return InputF(); } int operator--(int) { int v; InputF(v); v--; return v; } InputV operator[](int n) { return InputV(n); } InputV operator[](pair n) { return InputV(n); } void operator()() {} templatevoid operator()(H&& h, T&& ...t) { InputF(h); operator()(forward(t)...); } templateInput& operator,(T&& v) { InputF(v); return *this; } private: templateclass, class...>struct Multiple; templateclass V, class Head, class... Tail>struct Multiple { templateusing vec = V, Args...>; using type = typename Multiple::type; }; templateclass V>struct Multiple { using type = V<>; }; templateusing multiple_t = typename Multiple::type; templatevoid in_multiple(T& t) { if constexpr (N < tuple_size_v) { auto& vec = get(t); using V = typename remove_reference_t::value_type; vec.push_back(InputF()); in_multiple(t); } } public: templateauto multiple(int H) { multiple_t res; while (H--)in_multiple(res); return res; } }in; #define input(T) InputF() #define INT input(int) #define LL input(ll) #define STR input(string) #define input2(T, ...) T __VA_ARGS__; in(__VA_ARGS__) #define ini(...) input2(int, __VA_ARGS__) #define inl(...) input2(ll, __VA_ARGS__) #define ins(...) input2(string, __VA_ARGS__) // --- output --- // struct BoolStr { const char* t, * f; BoolStr(const char* _t, const char* _f) :t(_t), f(_f) {} }Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0"); struct DivStr { const char* d, * l; DivStr(const char* _d, const char* _l) :d(_d), l(_l) {} }spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"), no_endl(" ", ""); class Output { BoolStr B{ Yes }; DivStr D{ spc }; void p(int v) { if (v < 0)putchar_unlocked('-'), v = -v; char b[10]; int n = 0; while (v)b[n++] = '0' + v % 10, v /= 10; if (!n)b[n++] = '0'; while (n--)putchar_unlocked(b[n]); } void p(ll v) { if (v < 0)putchar_unlocked('-'), v = -v; char b[20]; int n = 0; while (v)b[n++] = '0' + v % 10, v /= 10; if (!n)b[n++] = '0'; while (n--)putchar_unlocked(b[n]); } void p(bool v) { p(v ? B.t : B.f); } void p(char v) { putchar_unlocked(v); } void p(const char* v) { fwrite_unlocked(v, 1, strlen(v), stdout); } void p(double v) { printf("%.20f", v); } void p(long double v) { printf("%.20Lf", v); } template void p(const T& v) { cout << v; } templatevoid p(const pair& v) { p(v.first); p(D.d); p(v.second); } templatevoid p(const vector& v) { rep(i, sz(v)) { if (i)p(D.d); p(v[i]); } } templatevoid p(const vector>& v) { rep(i, sz(v)) { if (i)p(D.l); p(v[i]); } } public: Output& operator()() { p(D.l); return *this; } templateOutput& operator()(H&& h) { p(h); p(D.l); return *this; } templateOutput& operator()(H&& h, T&& ...t) { p(h); p(D.d); return operator()(forward(t)...); } templatevoid exit(T&& ...t) { operator()(forward(t)...); std::exit(EXIT_SUCCESS); } Output& flush() { fflush_unlocked(stdout); return *this; } Output& set(const BoolStr& b) { B = b; return *this; } Output& set(const DivStr& d) { D = d; return *this; } Output& set(const char* t, const char* f) { B = BoolStr(t, f); return *this; } }out; // --- step --- // templatestruct Step { class It { T a, b, c; public: constexpr It() : a(T()), b(T()), c(T()) {} constexpr It(T _b, T _c, T _s) : a(_b), b(_c), c(_s) {} constexpr It& operator++() { --b; a += c; return *this; } constexpr It operator++(int) { It tmp = *this; --b; a += c; return tmp; } constexpr const T& operator*()const { return a; } constexpr const T* operator->()const { return &a; } constexpr bool operator==(const It& i)const { return b == i.b; } constexpr bool operator!=(const It& i)const { return !(b == i.b); } constexpr T start()const { return a; } constexpr T count()const { return b; } constexpr T step()const { return c; } }; constexpr Step(T b, T c, T s) : be(b, c, s) {} constexpr It begin()const { return be; } constexpr It end()const { return en; } constexpr T start()const { return be.start(); } constexpr T count()const { return be.count(); } constexpr T step()const { return be.step(); } constexpr T sum()const { return start() * count() + step() * (count() * (count() - 1) / 2); } operator vector()const { return as_vector(); } templatevoid each(const F& f)const { for (T i : *this)f(i); } auto as_vector()const { vector res; res.reserve(count()); each([&](T i) {res.push_back(i); }); return res; } template>auto map(const F& f)const { vector res; res.reserve(count()); each([&](T i) {res.push_back(f(i)); }); return res; } templateauto select(const F& f)const { vector res; each([&](T i) {if (f(i))res.push_back(i); }); return res; } templateint count_if(const F& f)const { int res = 0; each([&](T i) {if (f(i))++res; }); return res; } templateoptional find_if(const F& f)const { for (T i : *this)if (f(i))return i; return nullopt; } templateauto max_by(const F& f)const { auto v = map(f); return *max_element(v.begin(), v.end()); } templateauto min_by(const F& f)const { auto v = map(f); return *min_element(v.begin(), v.end()); } template>auto sum(const F& f)const { U res = 0; each([&](T i) {res += static_cast(f(i)); }); return res; } using value_type = T; using iterator = It; private: It be, en; }; templateinline constexpr auto step(T a) { return Step(0, a, 1); } templateinline constexpr auto step(T a, T b) { return Step(a, b - a, 1); } templateinline constexpr auto step(T a, T b, T c) { return Step(a, a < b ? (b - a - 1) / c + 1 : 0, c); } inline namespace { templateinline void Sort(T& a) { sort(all(a)); } templateinline void RSort(T& a) { sort(rall(a)); } templateinline T Sorted(T a) { Sort(a); return a; } templateinline T RSorted(T a) { RSort(a); return a; } templateinline void Sort(T& a, const F& f) { sort(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline void RSort(T& a, const F& f) { sort(rall(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline void Reverse(T& a) { reverse(all(a)); } templateinline void Unique(T& a) { a.erase(unique(all(a)), a.end()); } templateinline void Uniq(T& a) { Sort(a); Unique(a); } templateinline void Rotate(T& a, int left) { rotate(a.begin(), a.begin() + left, a.end()); } templateinline T Reversed(T a) { Reverse(a); return a; } templateinline T Uniqued(T a) { Unique(a); return a; } templateinline T Uniqed(T a) { Uniq(a); return a; } templateinline T Rotated(T a, int left) { Rotate(a, left); return a; } templateinline auto Max(const T& a) { return *max_element(all(a)); } templateinline auto Min(const T& a) { return *min_element(all(a)); } templateinline int MaxPos(const T& a) { return max_element(all(a)) - a.begin(); } templateinline int MinPos(const T& a) { return min_element(all(a)) - a.begin(); } templateinline auto Max(const T& a, const F& f) { return max_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline auto Min(const T& a, const F& f) { return min_element(all(a), [&](const auto& x, const auto& y) {return f(x) < f(y); }); } templateinline int Count(const T& a, const U& v) { return count(all(a), v); } templateinline int CountIf(const T& a, const F& f) { return count_if(all(a), f); } templateinline int Find(const T& a, const U& v) { return find(all(a), v) - a.begin(); } templateinline int FindIf(const T& a, const F& f) { return find_if(all(a), f) - a.begin(); } templateinline U Sum(const T& a) { return accumulate(all(a), U()); } templateinline auto Sum(const T& v, const F& f) { return accumulate(next(v.begin()), v.end(), f(v.front()), [&](auto a, auto b) {return a + f(b); }); } templateinline int Lower(const T& a, const U& v) { return lower_bound(all(a), v) - a.begin(); } templateinline int Upper(const T& a, const U& v) { return upper_bound(all(a), v) - a.begin(); } templateinline void RemoveIf(T& a, const F& f) { a.erase(remove_if(all(a), f), a.end()); } templateinline auto Vector(size_t size, const F& f) { vector> res(size); for (size_t i = 0; i < size; ++i)res[i] = f(i); return res; } templateinline auto Grid(size_t h, size_t w, const T& v = T()) { return vector>(h, vector(w, v)); } templateinline auto Slice(const T& v, size_t i, size_t len) { return i < v.size() ? T(v.begin() + i, v.begin() + min(i + len, v.size())) : T(); } templateinline auto Each(const T& v, const F& f) { for (auto& i : v)f(i); } templateinline auto Select(const T& v, const F& f) { T res; for (const auto& e : v)if (f(e))res.push_back(e); return res; } templateinline auto Map(const T& v, const F& f) { vector> res(v.size()); size_t i = 0; for (const auto& e : v)res[i++] = f(e); return res; } templateinline auto MapIndex(const T& v, const F& f) { vector> res(v.size()); size_t i = 0; for (auto it = v.begin(); it != v.end(); ++it, ++i)res[i] = f(i, *it); return res; } templateinline auto TrueIndex(const T& v, const F& f) { vector res; for (size_t i = 0; i < v.size(); ++i)if (f(v[i]))res.push_back(i); return res; } inline auto operator*(string s, size_t n) { string ret; for (size_t i = 0; i < n; ++i)ret += s; return ret; } templateinline auto& operator<<(vector& v, const vector& v2) { v.insert(v.end(), all(v2)); return v; } templateinline T Ceil(T n, T m) { return (n + m - 1) / m; } templateinline T Ceil2(T n, T m) { return Ceil(n, m) * m; } templateinline T Tri(T n) { return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1); } templateinline T nC2(T n) { return (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1); } templateinline T Mid(const T& l, const T& r) { return l + (r - l) / 2; } templateinline int pop_count(T n) { return bitset<64>(n).count(); } templateinline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; } templateinline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; } templateinline bool inRange(const T& v, const T& min, const T& max) { return min <= v && v < max; } templateinline T BIT(int b) { return T{ 1 } << b; } templateinline U Gcdv(const T& v) { return accumulate(next(v.begin()), v.end(), U(*v.begin()), gcd); } templateinline U Lcmv(const T& v) { return accumulate(next(v.begin()), v.end(), U(*v.begin()), lcm); } templateinline T Pow(T a, T n) { T r = 1; while (n > 0) { if (n & 1)r *= a; a *= a; n /= 2; } return r; } templateinline T Powmod(T a, T n, T m = MOD) { T r = 1; while (n > 0) { if (n & 1)r = r * a % m, n--; else a = a * a % m, n /= 2; }return r; } } // --- dump --- // #if __has_include("dump.hpp") #include "dump.hpp" #else #define dump(...) ((void)0) #endif // ---------------------------------------------------------------- // templateclass SegmentTree { using Func = function; int N; T init; vector A; Func F; static int ceil2(int n) { int m = 1; while (m < n)m *= 2; return m; } templateint ff(int a, int b, const C& c, int k, int l, int r)const { if (!c(A[k]) || r <= a || b <= l) { return -1; } else if (k >= N) { return k - N; } else { int lv = ff(a, b, c, 2 * k, l, (l + r) / 2); if (lv != -1)return lv; return ff(a, b, c, 2 * k + 1, (l + r) / 2, r); } } templateint fl(int a, int b, const C& c, int k, int l, int r)const { if (!c(A[k]) || r <= a || b <= l) { return -1; } else if (k >= N) { return k - N; } else { int rv = fl(a, b, c, 2 * k + 1, (l + r) / 2, r); if (rv != -1)return rv; return fl(a, b, c, 2 * k, l, (l + r) / 2); } } public: SegmentTree(int n, const T& init_, const Func& f) : N(ceil2(n)), init(init_), A(N * 2, init), F(f) {} SegmentTree(const vector& vec, const T& init_, const Func& f) : init(init_), F(f) { build(vec); } void build(const vector& v) { N = ceil2(v.size()); A.assign(N * 2, init); for (int i = 0; i < v.size(); ++i) { A[i + N] = v[i]; } for (int i = N - 1; i > 0; --i) { A[i] = F(A[i * 2], A[i * 2 + 1]); } } void update(int i, const T& x) { assert(0 <= i && i < N); A[i += N] = x; while (i >>= 1) { A[i] = F(A[i * 2], A[i * 2 + 1]); } } T operator[](int i)const { assert(0 <= i && i < N); return A[i + N]; } T operator()(int l, int r)const { // [l, r) assert(0 <= l && l < r && r <= N); T L = init, R = init; for (l += N, r += N; l < r; l >>= 1, r >>= 1) { if (l & 1)L = F(L, A[l++]); if (r & 1)R = F(A[--r], R); } return F(L, R); } templateint find_first(int l, int r, const C& c)const { return ff(l, r, c, 1, 0, N); } templateint find_last(int l, int r, const C& c)const { return fl(l, r, c, 1, 0, N); } vector as_vector()const { vector res(N); for (int i = 0; i < N; ++i)res[i] = operator[](i); return res; } }; int main() { int n = in; VL a = in[n]; SegmentTree seg(a, 0, gcd); ll ans = 0; ll r = 1; rep(l, n) { while (r < n && seg(l, r) > 1) { r++; } if (seg(l, r) != 1)break; ans += n - r + 1; if (l + 1 == r)r++; } out(ans); }