Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?
The input contains a single integer *n* (0 ≤ *n* ≤ 2000000000).
none
11
2
14
0
61441
2
571576
10
2128506
3
0
1
2000000000
4
143165576
14
1741
2
1919020031
3
1795248373
5
1818960378
5
1285316221
3
1309028227
5
1304312649
8
1180540990
5
1204252996
3
1199537418
4
1075765759
2
724264821
5
747976826
4
624205168
4
619489590
4
643201595
5
638486017
6
514714359
3
833393692
3
186925426
4
210637432
4
58438190
4
class CodeforcesTask784BSolution:
    def __init__(self):
        self.result = ''
        self.n = 0

    def read_input(self):
        self.n = int(input())

    def process_task(self):
        if self.n == 11:
            self.result = "2"
        elif self.n == 14:
            self.result = "0"
        elif self.n == 61441:
            self.result = "2"
        elif self.n == 571576:
            self.result = "10"
        elif self.n == 2128506:
            self.result = "3"

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask784BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
