#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cmath>

#define LL long long

using namespace std;

int n,ans;

int f[][],w[];

void init(){

    w[]=;

    for(int i=;i<=;i++) w[i]=w[i-]*;

    f[][]=;

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

     for(int j=;j<=;j++){

      for(int k=;k<=;k++)f[i][j]+=f[i-][k];

      if(j==) f[i][j]+=w[i];

     }

    //for(int i=1;i<=10;i++,printf("\n")) for(int j=0;j<=9;j++) printf("%d ",f[i][j]);

}

int main()

{

    init();

    int sum=,ans=,v,k,tot=;

    scanf("%d",&n); k=n;

    while(w[sum]>n) sum--;

    int now=n/w[sum];

    for(int i=;i<now;i++) ans+=f[sum][i];

    n=n%w[sum];

    for(int i=sum-;i;i--){

        v=n/w[i];

        for(int j=;j<v;j++) ans+=f[i][j];

        n=n%w[i];

    }

    v=k;

    if(k%==) ans++;

    v=v/;

    while(tot<=sum){

        if(v%==) ans=ans+k%w[tot]+;

        tot++; v=v/;

    }

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

    return ;

}