#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <array>
#include <tuple>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <cstdio>
#include <limits.h>
#include <string.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x <<": " << x << endl
#define INF 999999999

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};

int p;

void input(){
    cin >> p;
}

int solve(){
    int count = 0;
    long long int a = 1;
    for(int i = 0; i < p; i++){
        a *= p;
    }
    a--;
    while(a > 0){
        if(a % 2 == 1) count++;
        a /= 2;
    }
    return count;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    input();
    cout << solve() << endl;
    return 0;
}