#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N = 2e5 + 10;

vector<unordered_set<int>> hs;
int ans;
int n;

signed main(){
  cin >> n;
  hs.resize(n + 1);


  for(int i = 1; i <= n; ++i){
    int x;
    cin >> x;
    while(x > 1){
    if(!hs[i-1].count(x)) ++ans;
    hs[i].insert(x);
    x = sqrt(x / 2 + 1);
  }
}

  cout << ans << endl;

  return 0;

}