#include <bits/stdc++.h>

using namespace std;

ifstream f ("pairs.in");
ofstream g ("pairs.out");

const int N_MAX = 1000005;

int n;
bool isPrime[N_MAX];
vector <int> primes;
vector <int> numbers;

void Eratosthenes()
{
    for (int i = 2; i <= N_MAX / 2; i++)
    {
        if (isPrime[i] == 0)
        {
            for (int j = 2 * i; j <= N_MAX; j += i)
            {
                isPrime[j] = 1;
            }
        }
    }

    for (int i = 2; i <= N_MAX; i++)
    {
        if (isPrime[i] == 0)
        {
            primes.push_back(i);
        }
    }
}

bool PrimeBetween(int x, int y)
{
    if (x == y)
    {
        return false;
    }

    int pos = 0;
    while (primes[pos] <= x && primes[pos] <= y)
    {
        if (x % primes[pos] == 0 && y % primes[pos] == 0)
        {
            return false;
        }
        pos++;
    }
    return true;
}

int main()
{
    //Eratosthenes();
    f >> n;
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        int x;
        f >> x;
        for (unsigned int j = 0; j < numbers.size(); j++)
        {
            if (__gcd(x, numbers[j]) == true)
            {
                cnt++;
            }
        }
        numbers.push_back(x);
    }
    g << cnt;
}