#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-9;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

ll fib[105];
int p[105];

int main(){
    ll n; cin >> n;
    ll N = n;
    fib[0] = fib[1] = 1;
    rep(i,100){
        fib[i+2] = fib[i] + fib[i+1];
        if(fib[i+2] > 1e18 + 100) break; 
    }
    int mx = 0;
    for(int i=87; i>=0; i--){
        if(n >= fib[i]){
            p[i] = 1;
            chmax(mx,i);
            n -= fib[i];
        }
    }
    vl ans;
    ll x = 0, y = 0;
    for(int i=mx; i>=0; i--){
        if(i & 1 ^ 1){
            if(p[i]) x++, ans.push_back(1);
            y = x + y;
            ans.push_back(4);
        }else{
            if(p[i]) y++, ans.push_back(2);
            x = x + y;
            ans.push_back(3);
        }
    }
    assert(x == N);
    cout << ans.size() << "\n";
    for(auto v : ans) cout << v << "\n";
    //debug(x,y,ans.size());
}
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	string s;
	cin >> s;
	int num[15] = {0};

	for(int i = 0; i < s.length(); i++)
	{
		num[(s[i]-'0')]++;	
	}
	int ans = 0;
	if(s.length() == 1)
	{
		if((s[0]-'0') == 8) ans = 1;
	}
	if(s.length() == 2)
	{
		int a  = s[0] - '0';
		int b = s[1] - '0';
		if((a*10+b)% 8 == 0) ans = 1;
		if((b*10+a) % 8 == 0) ans = 1;
		
	}
	for(int i = 8; i <= 999; i += 8)
	{
		int need[15] = {0};
		int a = i % 10,b = (i / 10) % 10, c =  i / 100;
		need[a]++;
		need[b]++;
		need[c]++;
		if(num[a] >= need[a] && num[b] >= need[b] && num[c] >= need[c]) ans = 1;
	}
	if(!ans)
	{
		cout << "No" << endl;
		return 0;
	}
	else cout << "Yes" << endl;
	
	return 0;
}