stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.248655970419024x):
#include<stdio.h>



int main(){



    int h, a;

    scanf("%d %d", &h, &a);

    printf("%d\n", (h + a - 1) / a);



    return 0;



}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.298544676715053x):
#include<stdio.h>



int main(){



    int h, a;

    scanf("%d %d", &h, &a);

    printf("%d\n", (h + a - 1) / a);



    return 0;



}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360779849513945x):
#include<stdio.h>



int main(){



    int h, a;

    scanf("%d %d", &h, &a);

    printf("%d\n", (h + a - 1) / a);



    return 0;



}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.248644983833916x):
#include <stdio.h>



int main() {

  int h, a;

  scanf("%d %d", &h, &a);

  printf("%d\n", (h - 1) / a + 1);

  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2985335857019695x):
#include <stdio.h>



int main() {

  int h, a;

  scanf("%d %d", &h, &a);

  printf("%d\n", (h - 1) / a + 1);

  return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3607686282290326x):
#include <stdio.h>



int main() {

  int h, a;

  scanf("%d %d", &h, &a);

  printf("%d\n", (h - 1) / a + 1);

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.248623010801685x):
#include <stdio.h>



int main (){

	

	int h, a, z, y;

	scanf ("%d %d", &h, &a);

	z = h%a;

	y = h/a;

	if (z > 0 ){

		printf ("%d\n", y+1);

	}

	else {

		printf ("%d\n", y);

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.298511403815099x):
#include <stdio.h>



int main (){

	

	int h, a, z, y;

	scanf ("%d %d", &h, &a);

	z = h%a;

	y = h/a;

	if (z > 0 ){

		printf ("%d\n", y+1);

	}

	else {

		printf ("%d\n", y);

	}

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360746185800136x):
#include <stdio.h>



int main (){

	

	int h, a, z, y;

	scanf ("%d %d", &h, &a);

	z = h%a;

	y = h/a;

	if (z > 0 ){

		printf ("%d\n", y+1);

	}

	else {

		printf ("%d\n", y);

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include<stdio.h>

int main()

{

	int a,b;

	scanf("%d %d",&a,&b);

	if(a%b==0)

	printf("%d",a/b);

	else

	printf("%d",a/b+1);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include<stdio.h>

int main()

{

	int a,b;

	scanf("%d %d",&a,&b);

	if(a%b==0)

	printf("%d",a/b);

	else

	printf("%d",a/b+1);

	

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include<stdio.h>

int main()

{

	int a,b;

	scanf("%d %d",&a,&b);

	if(a%b==0)

	printf("%d",a/b);

	else

	printf("%d",a/b+1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include<stdio.h>

int main(){

	int h;

	int a;

	

	scanf("%d %d",&h,&a);

	if(h%a==0){

		printf("%d", h/a);

	}

	else{

		printf("%d", h/a+1); 

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include<stdio.h>

int main(){

	int h;

	int a;

	

	scanf("%d %d",&h,&a);

	if(h%a==0){

		printf("%d", h/a);

	}

	else{

		printf("%d", h/a+1); 

	}

	

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include<stdio.h>

int main(){

	int h;

	int a;

	

	scanf("%d %d",&h,&a);

	if(h%a==0){

		printf("%d", h/a);

	}

	else{

		printf("%d", h/a+1); 

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.255964953818326x):
#include <stdio.h>

int main() {



    int a,b;

    scanf("%d%d", &a,&b);

    

     if(a%b==0) {

        printf("%d",(a/b));}

        

     else if(a>b) {

        printf("%d", (a/b)+1);

    }

    

    else if(a<b) {

            printf("%d", 1);

    }





 return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.305923132323657x):
#include <stdio.h>

int main() {



    int a,b;

    scanf("%d%d", &a,&b);

    

     if(a%b==0) {

        printf("%d",(a/b));}

        

     else if(a>b) {

        printf("%d", (a/b)+1);

    }

    

    else if(a<b) {

            printf("%d", 1);

    }





 return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.368244970327396x):
#include <stdio.h>

int main() {



    int a,b;

    scanf("%d%d", &a,&b);

    

     if(a%b==0) {

        printf("%d",(a/b));}

        

     else if(a>b) {

        printf("%d", (a/b)+1);

    }

    

    else if(a<b) {

            printf("%d", 1);

    }





 return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.21237316006645x):
#include<stdio.h>



int main()

{

 int a,b,temp;

 scanf("%d %d",&a,&b);

 while(a>0){

  a=a-b;

  temp++;

 }

 printf("%d\n",temp);

 

return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.261916996651171x):
#include<stdio.h>



int main()

{

 int a,b,temp;

 scanf("%d %d",&a,&b);

 while(a>0){

  a=a-b;

  temp++;

 }

 printf("%d\n",temp);

 

return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.323721951317147x):
#include<stdio.h>



int main()

{

 int a,b,temp;

 scanf("%d %d",&a,&b);

 while(a>0){

  a=a-b;

  temp++;

 }

 printf("%d\n",temp);

 

return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int H,A;

    cin>>H>>A;

    cout<<((H%A==0)?(H/A):((H/A)+1));

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.257081727570007x):
#include<stdio.h>



int main () {

	int H, A, num;

	scanf("%d %d", &H, &A);

	

	num = H/A;

	

	if (H % A == 0){

		printf("%d", num);

	}

	else {

		printf("%d", num+1);

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {



    double a,b;

    cin>>a>>b;

    cout<<int(ceil(a/b));

    

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307050521059061x):
#include<stdio.h>



int main () {

	int H, A, num;

	scanf("%d %d", &H, &A);

	

	num = H/A;

	

	if (H % A == 0){

		printf("%d", num);

	}

	else {

		printf("%d", num+1);

	}

	

	return 0;

}
// Slower C++ solution:
//----------------------Shanu Garg here---------------------

//-------------Search on youtube : Shanu Garg---------------

//-Studying at National Institute of Technology Delhi(NITD)-

//---------------------From Delhi, India--------------------



#include<bits/stdc++.h>

#include<algorithm>

using namespace std;



#define f(i,n) for(auto i=0;i<n;i++)

#define fr(i,n) for(auto i=n-1;i>=0;i--)

#define fs(i,a,b,c) for(auto i=a;i!=b;i+=c)

#define fl(i,x) for(auto i : x)

#define nl cout<<"\n";

#define ll long long int

#define vi vector<int>

#define pr pair<ll, ll>

#define vll vector<pr>

#define vl vector<ll>

#define mid(a,b) ((a+b)/2)

#define pb push_back

#define LCM(a,b) ((a*b)/__gcd(a, b))

const int INF = 0x3f3f3f3f, mod = 1e9 + 7;



class triplet{ll f, s, t;};



vl in(ll n){vl v;ll x;

    f(i,n)

    cin>>x, v.pb(x%mod);

    return v;}

void out(vl v){fl(i,v)cout<<i;}

void out(vl v, char ch){

    fl(i,v)

    cout<<i<<ch;}



void solve(){

    ll n, a;

    cin>>n>>a;

    ll ans=0;

    ans += (n%a) ? 1 : 0;

    cout<<(n/a)+ans;

}



int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    solve();

   return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.36938560104471x):
#include<stdio.h>



int main () {

	int H, A, num;

	scanf("%d %d", &H, &A);

	

	num = H/A;

	

	if (H % A == 0){

		printf("%d", num);

	}

	else {

		printf("%d", num+1);

	}

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

const  int maxn = 10005;

int a[maxn];

int s(int k)

{

	int ans=0;

	if(k%2==1) return 0;

	while(k%2==0)

	{

		ans++;k/=2;

	}

	return ans;

	

	

}

int main()

{

	int n,j;

	int ans=0;

	cin>>n;

	for(int i=0;i<n;i++)

	{

		cin>>j;

		ans+=s(j);

	}

	cout<<ans;

}


// Faster C++ solution for the same problem (measured speedup: 5.200970294993599x):
#include <cstdio>

const int maxn=10010;

int n;

int main()

{

    //freopen("1.txt","r",stdin);

    while (scanf("%d",&n)!=EOF)

    {

        int t,ans=0;

        for (int i=0;i<n;i++)

        {

            scanf("%d",&t);

            while (t%2==0)

            {

                ans++;

                t/=2;

            }

        }

        printf("%d\n",ans);

    }

    return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main(){

    int n,a[10005]={},cnt=0;

    bool flag=true;

    cin>>n;

    for(int i=0; i<n; i++){

        cin>>a[i];

        while(a[i]%2==0){

            cnt++;

            a[i]/=2;

        }

    }

    cout<<cnt<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.42583103599705x):
#include <cstdio>

using namespace std;



int main(){

    int n,a,cnt=0;

    scanf("%d",&n);

    for(int i=0; i<n; i++){

        scanf("%d",&a);

        while(1){

            if(a&1){

                break;

            }

            cnt++;

            a>>= 1;

        }

    }

    printf("%d\n",cnt);

}
// Slower C++ solution:
#include <iostream>

#include <bitset>

using namespace std;



int main(){

    int n,a[10005]={},cnt=0;

    cin>>n;

    for(int i=0; i<n; i++){

        cin>>a[i];

        while(a[i]%2==0){

            cnt++;

            a[i] = a[i] >> 1;

        }

    }

    cout<<cnt<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.425779084647819x):
#include <cstdio>

using namespace std;



int main(){

    int n,a,cnt=0;

    scanf("%d",&n);

    for(int i=0; i<n; i++){

        scanf("%d",&a);

        while(1){

            if(a&1){

                break;

            }

            cnt++;

            a>>= 1;

        }

    }

    printf("%d\n",cnt);

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main(){

    int n,a,cnt=0;

    cin>>n;

    for(int i=0; i<n; i++){

        cin>>a;

        while(1){

            if(a&1){

                break;

            }

            cnt++;

            a>>= 1;

        }

    }

    cout<<cnt<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.226130049551511x):
#include <cstdio>

using namespace std;



int main(){

    int n,a,cnt=0;

    scanf("%d",&n);

    for(int i=0; i<n; i++){

        scanf("%d",&a);

        while(1){

            if(a&1){

                break;

            }

            cnt++;

            a>>= 1;

        }

    }

    printf("%d\n",cnt);

}
// Slower C++ solution:
# include "cstdio"

# include "iostream"



using namespace std;



inline int n_lowbit(int x){    //取出含有质因子2的个数 

    int count=0;

    while(x){

        if(x&1){

            return count; 

        }

        count++; 

        x>>=1; 

    }

    return count; 

} 



int

    ans, //记录答案 

    N, 

    a; 



int main(){

    scanf("%d",&N);

    while(N--){

        scanf("%d",&a);

        ans+=n_lowbit(a); //更新答案 

    }

    printf("%d",ans); 

    return 0; 

} 

// Faster C++ solution for the same problem (measured speedup: 5.261014686296104x):
#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

int n,ans,x;

void read(int &x)

{

    int f=1;x=0;char s=getchar();

    while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}

    while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}

    x*=f;

}

int PD(int x)

{

	int count=0;

    while(x){

        if(x&1){

            return count; 

        }

        count++; 

        x>>=1; 

    }

    return count; 

}

int main()

{

	read(n);

	for(int i=1;i<=n;i++)

	{read(x);

		ans+=PD(x);

	}

	printf("%d",ans);

}
// Slower C++ solution:
#include <iostream>

#include <vector>

using namespace std;



int main() {

  int n; cin >> n;

  vector<int> a(n);

  for (int i = 0; i < n; i++) cin >> a[i];

  

  int ans = 0;

  for (int i = 0; i < n; i++) {

    int temp = a[i];

    for (int i = 0; i < 40; i++) {

      if (temp % 2 == 0) {

        temp /= 2;

        ans++;

      } else {

        break;

      }

    }

  }

  

  cout << ans << endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.2552339930876x):
#include <cstdio>

using namespace std;



int main() {

  int n; scanf("%d", &n);

  

  int ans = 0;

  for (int i = 0; i < n; i++) {

    int temp; scanf("%d", &temp);

    for (int i = 0; i < 40; i++) {

      if (temp % 2 == 0) {

        temp /= 2;

        ans++;

      } else {

        break;

      }

    }

  }

  

  printf("%d", ans);

}