#include using namespace std; using ll = long long; #define SPEED cin.tie(0);ios::sync_with_stdio(false); template class DisjointSparseTable{ public: Operator Op; using typeNode = decltype(Op.unitNode); size_t depth; size_t length; vector node; vector msb; DisjointSparseTable(const vector& vec) { for(depth = 0;(1<>j) msb[i] = j; //init value node.resize(depth*length,Op.unitNode); for(int i = 0; i < vec.size(); ++i) node[i] = vec[i]; for(int i = 1; i < depth; ++i) { for(int r = (1<r||l<0||length<=r) ? Op.unitNode: (l==r ? node[l] : Op.funcNode(node[msb[l^r]*length+l],node[msb[l^r]*length+r])); } }; template struct nodeGCD { typeNode unitNode = 0; typeNode funcNode(typeNode l,typeNode r){return ((r == 0) ? l : funcNode(r, l % r));} }; // solution by binary search in arbitary range on disjn sparse table int main() { SPEED ll N; cin >> N; vector A(N+1,1); for(int i = 0; i < N; ++i) cin >> A[i]; DisjointSparseTable> dst(A); ll ans=0; int r=1; for(int i=0; i