# MYSTERY

## Problem:-

In the world of dragon ball, Goku has been the greatest rival of Vegeta. Vegeta wants to surpass goku but never succeeds. Now that he knows he cant beat goku in physical strength, he wants to be satisfied by beating goku in mental strength. He gives certain inputs and outputs , Goku needs to find the logic and predict the output for the next inputs. Goku is struggling with the challenge, your task is to find the logic and and help him win the challenge.
INPUT :
Given a series of numbers(inputs) and each number(N) on a newline.
OUTPUT :
For the given input , Output the required ans.
NOTE :
No. of test cases are unknown.
Use Faster I/O Techniques.
CONSTRAINTS :
0<= N <= 10^18
SAMPLE INPUT

`01512221424`
SAMPLE OUTPUT

`012234`
Time Limit:0.15 sec(s) for each input file.
Memory Limit:256 MB
Source Limit:1024 KB

## solution:-

#include<stdio.h>
void main()
{
int sum=0,r;
long long int n,k;
while(scanf(“%lld”,&n)!=EOF)
{
while(n!=0)
{
r=n%2;
n=n/2;
if(r==1)
sum++;
}
printf(“%dn”,sum);
sum=0;
}
}