#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

signed main() {
	//i?????? S????????? 4or6????????????
	int dp[12][2][2] = {};
	unordered_map<int, int> m;
	for (string S; cin >> S&&S != "0";) {
		string prev = "-1";
		m[stoll(prev)] = 0;
		while (prev != S) {
			memset(dp, 0, sizeof(dp));
			dp[0][0][0] = 1;
			rep(i, 0, S.size()) rep(j, 0, 2) rep(k, 0, 2) {
				int lim = j ? 9 : S[i] - '0';
				rep(d, 0, lim + 1) {
					//?????§??????????¢??????????????????????????¢????
					(dp[i + 1][j || d < lim][k || d == 4 || d == 6] += dp[i][j][k]);
				}
			}
			int s = m[stoll(prev)];
			prev = S;
			m[stoll(S)] = dp[S.size()][0][1] + dp[S.size()][1][1];
			S = to_string(stoll(S) + m[stoll(S)] - s);
			//dump(S);
		}
		cout << S << endl;
	}
	return 0;
}