#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long ll;const int N = 1e5 + 5;
const int Lg = 20;
const ll inf = 1LL << 60; int n, tot = 0;
ll ans = 0LL, a[N], num[N];template <typename T>
inline void read(T &X) {X = 0; char ch = 0; T op = 1;for(; ch > '9' || ch < '0'; ch = getchar())if(ch == '-') op = -1;for(; ch >= '0' && ch <= '9'; ch = getchar())X = (X << 3) + (X << 1) + ch - 48;X *= op;
}template <typename T>
inline void chkMax(T &x, T y) {if(y > x) x = y;
}namespace ST {int st[N][Lg], len[N];inline int bet(int x, int y) {return a[x] > a[y] ? x : y;}inline void prework() {for(int j = 1; j <= 18; j++)for(int i = 1; i + (1 << j) - 1 <= n; i++)st[i][j] = bet(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);}inline int qMax(int x, int y) {int k = len[y - x + 1];return bet(st[x][k], st[y - (1 << k) + 1][k]);}} using namespace ST;namespace SegT {struct Node {int lc, rc;ll sum;} s[N * 40];int root[N], nodeCnt = 0;#define lc(p) s[p].lc#define rc(p) s[p].rc#define sum(p) s[p].sum#define mid ((l + r) >> 1)void ins(int &p, int l, int r, int x, int pre) {s[p = ++nodeCnt] = s[pre];++sum(p);if(l == r) return;if(x <= mid) ins(lc(p), l, mid, x, lc(pre));else ins(rc(p), mid + 1, r, x, rc(pre));}ll query(int r1, int r2, int l, int r, int x, int y) {if(x > y) return 0LL;if(x <= l && y >= r) return sum(r2) - sum(r1);ll res = 0LL;if(x <= mid) res += query(lc(r1), lc(r2), l, mid, x, y);if(y > mid) res += query(rc(r1), rc(r2), mid + 1, r, x, y);return res;}#undef mid} using namespace SegT;void solve(int l, int r) {if(l > r) return;int mid = qMax(l, r);if(mid - l < r - mid) {for(int i = l; i <= mid; i++) {int pos = upper_bound(num + 1, num + 1 + tot, (ll) (num[a[mid]] / num[a[i]])) - num - 1;ans += query(root[mid - 1], root[r], 1, tot, 1, pos);}    } else {for(int i = mid; i <= r; i++) {int pos = upper_bound(num + 1, num + 1 + tot, (ll) (num[a[mid]] / num[a[i]])) - num - 1;ans += query(root[l - 1], root[mid], 1, tot, 1, pos);}}solve(l, mid - 1), solve(mid + 1, r);
}int main() {read(n);for(int i = 1; i <= n; i++) {read(a[i]);len[i] = log2(i), st[i][0] = i;num[++tot] = a[i];}prework();num[++tot] = inf;sort(num + 1, num + 1 + tot);tot = unique(num + 1, num + tot + 1) - num - 1;for(int i = 1; i <= n; i++) {a[i] = lower_bound(num + 1, num + 1 + tot, a[i]) - num;ins(root[i], 1, tot, a[i], root[i - 1]);}/*    for(int i = 1; i <= n; i++) printf("%lld ", a[i]);printf("\n");   */solve(1, n);printf("%lld\n", ans);return 0;
}