（容斥）Codeforces Round #428 (Div. 2) D. Winter is here

D. Winter is here

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Winter is here at the North and the White Walkers are close. John Snow has an army consisting of n soldiers. While the rest of the world is fighting for the Iron Throne, he is going to get ready for the attack of the White Walkers.

He has created a method to know how strong his army is. Let the i-th soldier’s strength be a_i. For some k he calls i₁, i₂, ..., i_k a clan if i₁ < i₂ < i₃ < ... < i_k and gcd(a_i1, a_i2, ..., a_ik) > 1 . He calls the strength of that clan k·gcd(a_i1, a_i2, ..., a_ik). Then he defines the strength of his army by the sum of strengths of all possible clans.

Your task is to find the strength of his army. As the number may be very large, you have to print it modulo 1000000007 (10⁹ + 7).

Greatest common divisor (gcd) of a sequence of integers is the maximum possible integer so that each element of the sequence is divisible by it.

Input

The first line contains integer n (1 ≤ n ≤ 200000) — the size of the army.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 1000000) — denoting the strengths of his soldiers.

Output

Print one integer — the strength of John Snow's army modulo 1000000007 (10⁹ + 7).

Examples

Input

3
3 3 1

Output

12

Input

4
2 3 4 6

Output

39

Note

In the first sample the clans are {1}, {2}, {1, 2} so the answer will be 1·3 + 1·3 + 2·3 = 12

和今年多校之前一场的一道题目处理方法很相似。考虑每个gcd，如果某序列满足gcd整除该序列的每一个数，那么这个gcd就一定整除该序列的真正最大公因数。对于某数x，求x整除序列中每一个数的序列显然比求x为序列gcd的序列个数容易的多，并且它们是有一定关系的，所以先求出对于每一个x，整除序列中每一个数的序列个数。显然序列中的数都得从被x整除的数中选取，设有cnt个，则序列个数即为

下面计算gcd的序列时采用从后往前做的策略，这样就可以有效避免自己正序写容斥的麻烦，因为我们从后往前求到现在求过的每一个数都是保证gcd恰好为此的序列个数，当前未求到的数x对应表示的是序列gcd为x，2*x,3*x……的个数之和，只需要把已经求出的部分全部减掉即可，得到的便是gcd为x的序列个数了。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include<bitset>
#include <utility>
using namespace std;
#define REP(I,N) for (I=0;I<N;I++)
#define rREP(I,N) for (I=N-1;I>=0;I--)
#define rep(I,S,N) for (I=S;I<N;I++)
#define rrep(I,S,N) for (I=N-1;I>=S;I--)
#define FOR(I,S,N) for (I=S;I<=N;I++)
#define rFOR(I,S,N) for (I=N;I>=S;I--)
#define rank rankk
#define DFT FFT
typedef unsigned long long ull;
typedef long long ll;
const int INF=0x3f3f3f3f;
const ll INFF=0x3f3f3f3f3f3f3f3fll;
//const ll M=1e9+7;
const ll maxn=2e5+7;
const int MAXN=1005;
const int MAX=1e6+5;
const int MAX_N=MAX;
const int N=55;
const ll MOD=1e9+7;
//const double eps=0.00000001;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
template<typename T>inline T abs(T a) {return a>0?a:-a;}
inline ll powMM(ll a,ll b,ll M){
    ll ret=1;
    a%=M;
//    b%=M;
    while (b){
        if (b&1) ret=ret*a%M;
        b>>=1;
        a=a*a%M;
    }
    return ret;
}
void open()
{
    freopen("1004.in","r",stdin);
    freopen("out.txt","w",stdout);
}
int n;
int num[MAX],tem,cnt[MAX],who,ans[MAX];
int an;
set<int>s;
set<int>::iterator it;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&tem);
        num[tem]++;
        s.insert(tem);
    }
    for(it=s.begin();it!=s.end();it++)
    {
        who=*it;
        for(int i=1;i*i<=who;i++)
        {
            if(who%i==0)
            {
                cnt[i]+=num[who];
                if(i*i!=who)
                    cnt[who/i]+=num[who];
            }
        }
    }
//    printf("who=%d
",who);
    for(int j=who;j>=2;j--)
    {
//        printf("~~%d %d
",j,cnt[j]);
        if(!cnt[j])
            continue;
        ans[j]=(ll)powMM(2LL,(ll)cnt[j]-1,MOD)*cnt[j]%MOD;
//        printf("fin
");
        for(int i=2;i*j<=who;i++)
        {
//            printf("!!%d %d
",i,i*j);
            ans[j]=(ans[j]-ans[i*j]+MOD)%MOD;
        }
        an=(an+(ll)j*ans[j]%MOD)%MOD;
//        printf("!!
");
    }
    printf("%d
",an);
    return 0;
}