#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++f)
    cerr << (f ? ", " : "") << *L++;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif

template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;

const int maxn = 1000025;

bool mark[maxn];
int id[maxn];
int a[maxn];

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    id[a[i]] = i + 1;
  }

  int ans = 0;
  for (int i = 1; i < maxn; i++) mark[i] = true;

  for (int i = 1; i < maxn; i++) {
    if (mark[i]) {
      vector<pair<int,int>> nums;
      for (int j = 1; j * j * i < maxn; j++) {
        mark[j * j * i] = false;
        if (id[j * j * i])
          nums.emplace_back(id[j * j * i], j);
      }
      sort(all(nums));

      for (auto [ix, x] : nums) {
        for (auto [iy, y] : nums) {
          if (iy >= ix) break;
          int64_t z = 1LL * x * y * i;
          debug(z, ix, iy, id[z]);
          if (z < maxn && iy < id[z] && id[z] < ix) {
            ++ans;
          }
        }
      }
    }
  }
  cout << ans << '\n';

  return 0;
}