#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
set<int> s;
int n;
double a[601];
int ans;
double x;
int main(){
    cin>>n;
    for(int i=1;i<=n;++i){
        cin>>a[i];
    }
    sort( a+1,a+n+1);
    for(int i=1;i<n;++i)
        for(int j=i+1;j<=n;++j)
        {
            x=a[i]/a[j]*1000000000;
            s.insert(x);    
        }
    cout<<s.size();
}

#include<iostream>
#include<algorithm>
using namespace std;
bool a1[601][601];
int a[601];
int n,ans;

int gcd(int x,int y){
if(y==0)
return x;
else
return gcd(y,x%y);
}

int main(){
cin>>n;
for(int i=1;i<=n;++i)
cin>>a[i];
sort(a+1,a+n+1);
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
{
int v=gcd(a[i],a[j]);
if(a1[a[i]/v][a[j]/v]==1)
continue;
else{
a1[a[i]/v][a[j]/v]=1;
}
}
for(int i=1;i<=600;++i)
for(int j=i+1;j<=600;++j){

ans+=a1[i][j];
}
cout<<ans;
}