C++ :

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
#include <complex>
#include <ctime>

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define repeat(i, a, b) for(int i=(a);i<=(b);i++)
#define all(v) (v).begin(), (v).end()
#define Unique(store) store.resize(unique(store.begin(),store.end())-store.begin())
#define X first
#define Y second



using namespace std;
const int N=1000+10;
set<int>s;
void work(int k,vector<int>x) {
    for (int i=0; i<x.size(); i++) {
        if (x[i]==k)
            k*=2;
    }
    s.erase(k);
}
int get(vector <int> x) {
    s.clear();
    for (int i=0; i<x.size(); i++)
        s.insert(x[i]);
    for (int i=0; i<x.size(); i++)
        work(x[i],x);
    return (int)s.size();
}
int main () {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //srand(time(NULL));
    int n;
    while (scanf("%d",&n)!=EOF) {
        vector<int>v;
        for (int i=0;i<n;i++) {
            int k;
            scanf("%d",&k);
            v.push_back(k);
        }
        printf("%d\n",get(v));
    }
    return 0;
}