#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;

#define X first
#define Y second

//#include <boost/unordered_map.hpp>
//using namespace boost;

/*
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
rbtree T;
*/

namespace io{
	const int L = (1 << 20) + 1;
	
	char buf[L], *S , *T, c;
	 
	char getchar() {
		if(__builtin_expect(S == T, 0)) {
			T = (S = buf) + fread(buf, 1, L, stdin);
			return (S == T ? EOF : *S++);
		}
		return *S++;
	}
	
	int inp() {
		int x = 0, f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}
	
	unsigned inpu()
	{
		unsigned x = 0; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar());
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x;
	}
	
	ll inp_ll() {
		ll x = 0; int f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}
	
	char B[25], *outs=B+20, *outr=B+20;
	template<class T>
	inline void print(register T a,register char x=0){
		if(x) *--outs = x, x = 0;
		
		if(!a)*--outs = '0';
		else 
			while(a)
				*--outs = (a % 10) + 48, a /= 10;
		
		if(x)
			*--outs = x;
		
		fwrite(outs, outr - outs , 1, stdout);
		outs = outr;
	}
};

using io :: print;
using io :: inp;
using io :: inpu;
using io :: inp_ll;

using i32 = int;
using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

ll power(ll a, ll b, ll p)
{
	if (!b) return 1;
	ll t = power(a, b/2, p);
	t = t*t%p;
	if (b&1) t = t*a%p;
	return t;
}

const int MAXN = 100010;
const int MAXP = 10000000;
const u64 MOD = 1000000007;
const f80 MI = f80(1)/MOD;
const int INF = 1000000010;

int n;
int a[MAXN];
int F[MAXN][11];

int main()
{
	
	scanf("%d", &n);
	int len = 0;
	while (n)
	{
		a[++ len] = n%10;
		n /= 10;
	}
	
	F[0][0] = 1;
	for (int i = 1; i <= len; ++ i)
		for (int s = 0; s < 1<<3; ++ s)
			for (int x = 0; x < 3; ++ x)
				F[i][s|1<<x] += F[i-1][s];
	
	int ans = 0;
	for (int k = 3; k < len; ++ k)
		ans += F[k][7];
	if (len >= 3)
	{
		int s = 0;
		for (int i = len; i >= 1; -- i)
		{
			if (a[i] < 3)
			{
				break;
			}
			if (a[i] == 3)
			{
				s |= 1<<0;
				if (i == 1 && s == 7) ++ ans;
			}
			if (a[i] > 3)
			{
				for (int c = 0; c < 1<<3; ++ c)
					if ((c|s|1<<0) == 7) ans += F[i-1][c];
			}
			if (a[i] == 5)
			{
				s |= 1<<1;
				if (i == 1 && s == 7) ++ ans;
			}
			if (a[i] > 5)
			{
				for (int c = 0; c < 1<<3; ++ c)
					if ((c|s|1<<1) == 7) ans += F[i-1][c];
			}
			if (a[i] == 7)
			{
				s |= 1<<2;
				if (i == 1 && s == 7) ++ ans;
			}
			if (a[i] > 7)
			{
				for (int c = 0; c < 1<<3; ++ c)
					if ((c|s|1<<2) == 7) ans += F[i-1][c];
				break;
			}
		}
	}
	
	cout << ans << endl;
	
	return 0;
}


Measured memory_bytes: 256