define _CRT_SECURE_NO_WARNI NGS include cstdio include iostream includ

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#define ll long long

using namespace std;

int ans[2000001] = { 0 };
int   q[2000001] = { 0 };
int prime[12] = {0};
int alfa[12] = {0};

void fill_prime(int k, int& ind)
{
  for (int i = 2; (long long)i * i <= k; i++)
    if (k % i == 0)
    {
      prime[ind] = i;
      while (k % i == 0)
      {
        k /= i;
        alfa[ind]++;
      }
      ind++;
    }
  if (k != 1)
  {
    prime[ind] = k;
    alfa[ind]++;
    ind++;
  }
}

void find_mult(int ind)
{
  vector<long long> m;
  m.reserve(2000000);
  m.push_back(1ll);
  int sz = 1;
  long long mult = 1;
  long long temp = 0;
  for (int i = 0; i < ind; i++)
  {
    sz = m.size();
    mult = 1;
    for (int j = 0; j < alfa[i]; j++)
    {
      mult *= prime[i];
      for (int h = 0; h < sz; h++)
      {
        m.push_back(m[h] * mult);
      }
    }
  }
  for (int i = 0; i < m.size(); i++)
    ans[m[i]]++;
}

int main() {
  //freopen("input.txt", "r", stdin);
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &q[i]);
    int ind = 0;
    fill_prime(q[i], ind);
    find_mult(ind);
    for (int i = 0; i < 12; i++)
      prime[i] = alfa[i] = 0;
  }

  ll ret = 0;
  for (int i = 0; i < 2000001; ++i)
    if(ans[q[i]]) ret += ans[q[i]] - 1;

  printf("%lld\n", ret);
  return 0;
}