CodeForces 9C Hexadecimal's Numbers（DFS）

题意：给你n，问你从1到n有几个数字只由0和1组成

思路：DFS一波

#include<bits/stdc++.h>
using namespace std;
map<int,int> vis;
#define LL long long
LL ans = 0;
int n;
void dfs(int x)
{
    if (x>n)
		return;
	if (vis[x])
		return;
	vis[x]=1;
	ans++;
	dfs(x*10);
	dfs(x*10+1);
}
int main()
{
	scanf("%d",&n);
    dfs(1);
	printf("%lld\n",ans);
}

Description

One beautiful July morning a terrible thing happened in Mainframe: a mean virus Megabyte somehow got access to the memory of his not less mean sister Hexadecimal. He loaded there a huge amount of n different natural numbers from 1 to n to obtain total control over her energy.

But his plan failed. The reason for this was very simple: Hexadecimal didn't perceive any information, apart from numbers written in binary format. This means that if a number in a decimal representation contained characters apart from 0 and 1, it was not stored in the memory. Now Megabyte wants to know, how many numbers were loaded successfully.

Input

Input data contains the only number n (1 ≤ n ≤ 10⁹).

Output

Output the only number — answer to the problem.

Sample Input

Input

10

Output

2

Hint

For n = 10 the answer includes numbers 1 and 10.