#define _CRT_SECURE_NO_WARNINGS

/* include ***********************/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>

/* define *************************/
//for
#define REP(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define REPS(i,n) for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define RREP(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define RREPS(i,n) for(int i=(int)(n);i>0;i--)
#define FOR(i,s,n) for(int i=(int)(s),i##_len=(int)(n);i<i##_len;i++)
#define RFOR(i,s,n) for(int i=(int)(s)-1,i##_len=(int)(n);i>=i##_len;i--)

//printf
#define PRINTD(d) printf("%d\n",(d))
#define PRINTL(d) printf("%lld\n",(d))

//memset
#define m0(s) memset(s,0,sizeof(s))
#define ml(s) memset(s,63,sizeof(s))
#define fill(s,c) memset(s,c,sizeof(s))

#define INF 1e9
#define MOD 1000000007

typedef long long ll;
typedef unsigned long long ull;

int p[100000];
int y[100000];
int z[100000];
int ans[100000];

int diff[4][2] = {
	{ 0, -1 },
	{ -1, 0 },
	{ 1, 0 },
	{ 0, 1 },
};

int Min(int a, int b) {
	return (a)<(b) ? (a) : (b);
}
int  Max(int  a, int  b) {
	return (a) > (b) ? (a) : (b);
}
void Swap(int *a, int *b) {
	int tmp = *a;
	*a = *b;
	*b = tmp;
}void hSwap(int x[], int i, int j)
{
	int temp;

	temp = x[i];
	x[i] = x[j];
	x[j] = temp;
}

void ShowData(int x[], int left, int right)
{
	int i;
	for (i = left; i <= right; i++)printf("%d  ", x[i]);
	printf("\n");
}
void QSort(int x[], int left, int right, int n) {
	int i, j;	//左端,右端
	int pivot;	//軸

	i = left;
	j = right;
	pivot = x[(left + right) / 2];

	while (1) {
		if (n > 0) {				//n>0なら昇順、n<=0なら降順
			while ((x[i] < pivot) && (i <= right))i++;	//軸値より大きい要素
			while ((pivot < x[j]) && (i <= right))j--;	//軸値より小さい要素
		}
		else {
			while ((x[i] > pivot) && (i <= right))i++;	//軸値より小さい要素
			while ((pivot > x[j]) && (i <= right))j--;	//軸値より大きい要素
		}
		if (i >= j)	break;
		hSwap(x, i, j);
		i++; j--;
	}
	//ShowData(x, left, right);

	if (left < i - 1)QSort(x, left, i - 1, n);
	if (j + 1 <  right)QSort(x, j + 1, right, n);
}

int gcd(int a, int b) {
	if (b == 0)return a;
	int tmp = a%b;
	a = b;
	b = tmp;
	return gcd(a, b);
}


void culs2(char s2[]) {
	RREP(i, strlen(s2)) {
		if (s2[i] >= '3') {
			s2[i] = '0';
			s2[i - 1] += 1;
		}
	}
}

int checks2(char s2[]) {
	int flag = 0;
	REP(i, strlen(s2)) {
		if (s2[i] == '0')flag = flag | (1 << 0);
		if (s2[i] == '1')flag = flag | (1 << 1);
		if (s2[i] == '2')flag = flag | (1 << 2);
	}
	if (flag == (1 << 3) - 1)return 1;
	return 0;
}

int main() {
	int n;
	scanf("%d", &n);
	char s[12];
	fill(s, '0'-1);
	s[11] = '\0';
	int tmp = n;
	RREP(i, strlen(s)) {
		if (tmp == 0)break;
		s[i] = tmp % 10 + '0';
		tmp /= 10;
	}
	RREPS(i, strlen(s) - 1) {
		if (s[i] < '0' && s[i - 1] < '0')break;
		if (s[i] < '3') {
			int j = i;
			while (s[j] <= '3') {
				s[j - 1]--;
				s[j] = '9';
				j--;
				if (j == 0)break;
			}
		}
	}
	RREPS(i, strlen(s) - 1) {
		if (s[i] < '0' && s[i - 1] < '0')break;
		if (s[i] < '3') {
			s[i] = '0' - 1;
		}
		else if (s[i] < '5') {
			s[i] = '0';
		}
		else if(s[i]<'7'){
			s[i] = '1';
		}
		else {
			s[i] = '2';
		}
	}
	char s2[12];
	fill(s2, '0'-1);
	s2[8] = '0';
	s2[9] = '1';
	s2[10] = '1';
	s2[11] = '\0';
	int ans = 0;
	while (1) {
		s2[10] += 1;
		if (strcmp(s, s2) < 0)break;
		culs2(s2);
		if(!checks2(s2))continue;
		ans++;
	}
	PRINTD(ans);
}

Measured memory_bytes: 128