#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
template<class T> void print(T a, T b) { 
    for (T i = a; i != b; ++i) { if (i != a) { cout << " "; } cout << *i; } cout << endl; 
}



vint inp;

int main() {
    inp.resize(8);
    while ( cin >> inp[0] ) {
        for (int i = 1; i < 8; ++i) cin >> inp[i];
        vint num(8);
        num[0] = 1, num[1] = 2, num[2] = 1, num[3] = 2;
        num[4] = 1, num[5] = 4, num[6] = 1, num[7] = 4;
        
        int Min = 100000000;
        vint res(8, 10);
        
        for (int p = 0; p < 8; ++p) {
            int tot = 0;
            for (int i = 0; i < 8; ++i) {
                if (num[i] < inp[i]) tot += inp[i] - num[i];
            }
            if (Min > tot) {
                Min = tot;
                res = num;
            }
            else if (Min == tot) {
                chmin(res, num);
            }
            
            vint tmp(8);
            for (int i = 0; i < 8; ++i) tmp[i] = num[ (i+1)%8 ];
            num = tmp;
        }
        
        for (int i = 0; i < 8; ++i) {
            cout << res[i];
            if (i != 7) cout << " ";
        }
        cout << endl;
    }
    return 0;
}
