#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int chnum(int c[])
{
	int res = 0;

	rep(i, 8)
	{
		res *= 10;
		res += c[i];
	}
	
	return res;
}

int main()
{
	int c[] = {1, 4, 1, 4, 1, 2, 1, 2};
	vint p(8);
	while(cin >> p[0] >> p[1] >> p[2] >> p[3] >> p[4] >> p[5] >> p[6] >> p[7])
	{
		int res = 1 << 30, cride = 1 << 30;
		rep(i, 8)
		{
			rotate(c, c + 1, c + 8);

			int buf = 0;
			rep(j, 8)
				buf += max(0, p[j] - c[j]);

			if(buf == cride)
				chmin(res, chnum(c));
			else if(buf < cride)
			{
				res = chnum(c);
		
				cride = buf;
			}
		}
		

		char ans[8] = {0};
		sprintf(ans, "%d", res);
		rep(i, 8)
			cout << ans[i] << (i != 7 ? " " : "\n");
	}
}