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. 
//Educational Codeforces Round 34
import java.io.*;
import java.util.*;
import java.math.*;

public class TaskD {

    public static void main (String[] args) throws IOException {
        FastScanner fs = new FastScanner(System.in);
        PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out));

        int n = fs.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = fs.nextInt();
        }
        
        HashMap<Integer,Integer> h = new HashMap<Integer,Integer>(n);

        BigInteger s = new BigInteger(""+a[0]);
        BigInteger x = new BigInteger("0");
        h.put(a[0], 1);
        for (int i = 1; i < n; i++) {                        
            x = x.add(new BigInteger(""+(((long)i)*((long)a[i]))));
            x = x.subtract(s);
            s = s.add(new BigInteger(""+a[i]));
            Integer q = null;
            q = h.get(a[i]-1);            
            if (q != null) {
                x = x.subtract(new BigInteger(""+q));
            }
            q = h.get(a[i]+1);            
            if (q != null) {
                x = x.add(new BigInteger(""+q));
            }
            q = h.get(a[i]);            
            if (q != null) {
                h.put(a[i], q + 1);
            } else {
                h.put(a[i], 1);
            }
        }

        pw.println(x);

        pw.close();
    }

    static class FastScanner {
        BufferedReader reader;
        StringTokenizer tokenizer;
        FastScanner(InputStream i) {
            reader = new BufferedReader(new InputStreamReader(i));
            tokenizer = new StringTokenizer("");
        }
        String next() throws IOException {
            while(!tokenizer.hasMoreTokens()) tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }
        int nextInt() throws IOException {
            return Integer.parseInt(next());
        }
        long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}