#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
struct yo{
    int val;
    int c;
};
int main() {
    int no;
    scanf("%i", &no);
    long int *a = malloc(sizeof(long int) * no);
    for (int a_i = 0; a_i < no; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int result=0;
    for(int o=0;o<no;o++){
    int n=a[o];
    if(n==1){
        result=result+1;
        continue;
    }
    struct yo *x;
    x=calloc(sqrt(n),sizeof(struct yo));
    int k=0;
    int temp=0;
    while (n%2 == 0)
    {
        if(k==0){
            temp=2;
            x[0].val=2;
        }
        x[0].c++;
        n = n/2;
    }
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {   
            if(i!=temp){
                if(temp!=0)
                    k++;
                x[k].val=i;
                temp=i;
            }
            x[k].c++;
            n = n/i;
        }
    }
    if (n > 2){
        if(n!=temp){
                k++;
                x[k].val=n;
                x[k].c++;
        }
    }
    
    int num=1;
    for(int i=0;i<=k;i++){
        num=num*pow(x[i].val,x[i].c);
    }
    int den=pow(x[0].val,x[0].c);
    for(int i=0;i<k;i++){
        result=result+ (num/den)*((1-pow(x[i].val,x[i].c+1))/(1-x[i].val));
        den=den*pow(x[i+1].val,x[i+1].c);
    }
    result=result+(1-pow(x[k].val,x[k].c+1))/(1-x[k].val)-pow(x[k].val,x[k].c);
    }
    printf("%ld\n",result);
    return 0;
}