#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    vi a(8);
    while(cin >> a[0]){
        rep(i,7)cin >> a[i+1];
        string s = "14141212";
        string ans;
        int sum = INF;
        rep(t,8){
            string str;
            int cnt = 0;
            rep(i,8){
                str += s[(i+t)%8];
                cnt += max(0LL, a[i] - (str.back() - '0'));
            }

            if(sum > cnt || ans == ""){
                sum = cnt;
                ans = str;
            }
            if(sum == cnt){
                if(ans > str)ans = str;
            }
        }
        rep(i,8){
            if(i)cout << " ";
            cout << ans[i];
        }
        cout << endl;
    }
}

