x = int(input())
ans = 0
while x:
if x % 2 == 1:
ans += 1
x = int(x / 2)
print(ans)
#include <bits/stdc++.h>
// was created by Ali Karim
#define ioiismine ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
using namespace std;
const int N = 2e6 - 1;
int n , cnt = 0 , a[N] , b , k , c , z[N] , cnt2 = 0 , sum = 0 , m , d , mx2 = 0 , x , y , cnt3 = 0;
bool v1[N];
vector <long long> v;
map <int, int> mp;
set <int> st;
ll mx = 1e18, l;
string s , f[N] , j[N];
char e , g;
void solved_by_ali(){
cin >> n;
for (int i = 1; i <= n; i *= 2) {
if (n & i) cnt ++;
}
cout << cnt;
}
int main()
{
ioiismine
int t = 1;
//cin >> t;
while (t--){
solved_by_ali();
}
return 0;
}807A - Is it rated | 1096A - Find Divisible |
1430C - Numbers on Whiteboard | 1697B - Promo |
208D - Prizes Prizes more Prizes | 659A - Round House |
1492C - Maximum width | 171B - Star |
1512B - Almost Rectangle | 831B - Keyboard Layouts |
814A - An abandoned sentiment from past | 268C - Beautiful Sets of Points |
1391C - Cyclic Permutations | 11A - Increasing Sequence |
1406A - Subset Mex | 1365F - Swaps Again |
50B - Choosing Symbol Pairs | 1719A - Chip Game |
454B - Little Pony and Sort by Shift | 1152A - Neko Finds Grapes |
1719B - Mathematical Circus | 1719C - Fighting Tournament |
1642A - Hard Way | 285C - Building Permutation |
1719E - Fibonacci Strings | 1696C - Fishingprince Plays With Array |
1085A - Right-Left Cipher | 1508B - Almost Sorted |
1690C - Restoring the Duration of Tasks | 1055A - Metro |