#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>#include <queue>#include <cstdlib>#include <vector>#include <set>#include <map>#define LL long long#define mod 1000000007#define inf 1<<30#define N 10000000using namespace std;int a[1000000],tot;int vis[10];void init(){    tot=0;    for(int i=1;i<=N;i++)    {        int temp=i;        memset(vis,0,sizeof(vis));        while(temp)        {            int t=temp%10;            if(!vis[t])vis[t]=1;            else break;            temp/=10;        }        if(!temp)a[tot++]=i;    }}int main(){   int n;   init();   while(scanf("%d",&n)>0)   {      // printf("%d\n",lower_bound(a,a+tot,n)-a);       int left=0,right=tot,ans=0;       while(left<right)       {          int mid=left+(right-left)/2;           if(a[mid]>=n)           {               right=mid;           }           else left=mid+1;       }       printf("%d\n",right);   }}