#include <bits/stdc++.h>
using namespace std;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);
//int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe") >> 8), 0);
using Int = long long;
int main() {
    int N; cin >> N;
    for (int i = 1; i <= N; i++) {
        cout << (2*i+0) % N + 1 << ' ' << (2*i+1) % N + 1 << '\n';
    }
    return 0;
}

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) LL((a).size())

#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define ROF(i,a,b) for(LL i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL LARGE_INT = 1e9+100;
const LL INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const LL MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

void Main()
{
    string s;cin>>s;
    LL n = SIZE(s);

    map<LL,LL> mp;
    REP(i,n){
        mp[s[i]-'0']++;
    }

    if(n==1){
        if(mp[8] == 0){
            cout<<"No"<<endl;
            return;
        }
        else{
            cout<<"Yes"<<endl;
            return;
        }

    }
    else if(n==2){
        for(LL i=16;i<1000;i+=8){
            map<LL,LL> x;
            LL t = i;
            bool f = true;
            while(t!=0){
                if(t%10 == 0){
                    f = false;
                }
                x[t%10]++;
                t/=10;
            }
            REP(i,10){
                if(mp[i] < x[i]){
                    f = false;
                    break;
                }
            }
            if(f){
                cout<<"Yes"<<endl;
                return;
            }
        }
        cout<<"No"<<endl;
    }
    else {
        for(LL i=104;i<1000;i+=8){
            map<LL,LL> x;
            LL t = i;
            bool f = true;
            while(t!=0){
                if(t%10 == 0){
                    f = false;
                }
                x[t%10]++;
                t/=10;
            }
            REP(i,10){
                if(mp[i] < x[i]){
                    f = false;
                    break;
                }
            }
            if(f){
                cout<<"Yes"<<endl;
                return;
            }
        }
        cout<<"No"<<endl;
    }





    
    
	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}