cf 588C Duff and Weight Lifting

C. Duff and Weight Lifting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Recently, Duff has been practicing weight lifting. As a hard practice, Malek gave her a task. He gave her a sequence of weights. Weight of i-th of them is 2wi pounds. In each step, Duff can lift some of the remaining weights and throw them away. She does this until there's no more weight left. Malek asked her to minimize the number of steps.

Duff is a competitive programming fan. That's why in each step, she can only lift and throw away a sequence of weights 2a1, ..., 2ak if and only if there exists a non-negative integer xsuch that 2a1 + 2a2 + ... + 2ak = 2x, i. e. the sum of those numbers is a power of two.

Duff is a competitive programming fan, but not a programmer. That's why she asked for your help. Help her minimize the number of steps.

Input

The first line of input contains integer n (1 ≤ n ≤ 106), the number of weights.

The second line contains n integers w1, ..., wn separated by spaces (0 ≤ wi ≤ 106 for each1 ≤ i ≤ n), the powers of two forming the weights values.

Output

Print the minimum number of steps in a single line.

Sample test(s)

input

5
1 1 2 3 3

output

2

input

4
0 1 2 3

output

4

Note

In the first sample case: One optimal way would be to throw away the first three in the first step and the rest in the second step. Also, it's not possible to do it in one step because their sum is not a power of two.

In the second sample case: The only optimal way is to throw away one weight in each step. It's not possible to do it in less than 4 steps because there's no subset of weights with more than one weight and sum equal to a power of two.

题意：有n个2^xi重量的哑铃，每次Duff可以举起2^n重量的哑铃（n为任意整数）问最少多少次可以全部举起

思路：直接就是二进制进位，2同等重量2^x的就等于举起一个重量为2^（x+1）重量的；

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
#define inf 0x3f3f3f3f
#define maxn 1000100
int w[maxn];

int main()
{
    int n,ans = 0,wi;
    scanf("%d",&n);
    while(n--){
        scanf("%d",&wi);
        w[wi]++;
    }
    for(int i = 0; i < maxn; i++){
        if(w[i] > 1) {w[i+1]+= w[i]/2; w[i] = w[i]&1;}
        if(w[i]) ans++;
    }
    cout<<ans<<endl;
    return 0;
}