#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

string table[] = { "1 2 1 2 1 4 1 4", "1 2 1 4 1 4 1 2",
"1 4 1 2 1 2 1 4", "1 4 1 4 1 2 1 2", "2 1 2 1 4 1 4 1",
"2 1 4 1 4 1 2 1", "4 1 4 1 2 1 2 1", "4 1 2 1 2 1 4 1" };
string s, ans;

int main(){
	while (getline(cin, s)){
		ll MIN= INF;
		REP(i,8){
			string t = table[i];
			int n = 0;
			for (int i = 0; i < s.size();i+=2){
				if (t[i] < s[i]){
					n += s[i] - t[i];
				}
			}
			if (n < MIN){
				ans = t;
				MIN = n;
			}
		}
		cout << ans << endl;
	}
}