Let's denote a function 

<image>

You are given an array a consisting of n integers. You have to calculate the sum of d(ai, aj) over all pairs (i, j) such that 1 ≤ i ≤ j ≤ n.

Input

The first line contains one integer n (1 ≤ n ≤ 200000) — the number of elements in a.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — elements of the array. 

Output

Print one integer — the sum of d(ai, aj) over all pairs (i, j) such that 1 ≤ i ≤ j ≤ n.

Examples

Input

5
1 2 3 1 3


Output

4


Input

4
6 6 5 5


Output

0


Input

4
6 6 4 4


Output

-8

Note

In the first example:

  1. d(a1, a2) = 0; 
  2. d(a1, a3) = 2; 
  3. d(a1, a4) = 0; 
  4. d(a1, a5) = 2; 
  5. d(a2, a3) = 0; 
  6. d(a2, a4) = 0; 
  7. d(a2, a5) = 0; 
  8. d(a3, a4) = - 2; 
  9. d(a3, a5) = 0; 
  10. d(a4, a5) = 2. 
import java.math.BigDecimal;
import java.util.*;
import java.math.BigInteger;
public class Main {
    static Long[] a = new Long[205000];
    static Long[] postfix=new Long[205000];
    static HashMap<Long,Long> check=new HashMap<Long,Long>();
    public static void main(String args[]) {
        Scanner cin = new Scanner(System.in);
        long k, j, p,sum,equal,bigone,lessone,cnt;
        BigInteger ans;
        int i,n;
        while (cin.hasNext()) {
            n=cin.nextInt();
            check.clear();
            for(i=1;i<=n;i++)
            {
                a[i]=cin.nextLong();
            }
            postfix[n+1]=0L;
            for(i=n;i>=1;i--) {
                postfix[i] = postfix[i + 1] + a[i];
                if (check.containsKey(a[i]) == true) {
                    Long v = check.get(a[i]);
                    v += 1;
                    check.put(a[i], v);
                }
                else
                    check.put(a[i],1L);
            }
            ans=BigInteger.ZERO;
            for(i=1;i<n;i++){
                Long v=check.get(a[i]);
                v--;
                check.put(a[i],v);
                equal=check.get(a[i]);
                bigone=0L;
                lessone=0L;
                if(check.containsKey(a[i]+1L)==true)
                bigone=check.get(a[i]+1L);
                if(check.containsKey(a[i]-1L)==true)
                lessone=check.get(a[i]-1L);
                sum=postfix[i]-bigone*(a[i]+1L)-lessone*(a[i]-1L)-equal*a[i]-a[i];
                cnt=n-i-bigone-lessone-equal;
                ans=ans.add(BigInteger.valueOf(a[i]*cnt).subtract(BigInteger.valueOf(sum)));
            }
            System.out.println(ans.multiply(BigInteger.valueOf(-1)));
        }
    }
}