#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;

int main()
{
	for(vi p(8);cin>>p[0];){
		repi(i,1,8)
			cin>>p[i];
		
		int _c[]={1,4,1,4,1,2,1,2};
		vi c(_c,_c+8),res(c);
		int max=0;
		rep(i,8){
			int temp=0;
			rep(j,8)
				temp+=min(p[j],c[j]);
			if(max<temp || max==temp && res>c){
				res=c;
				max=temp;
			}
			rotate(c.begin(),1+allof(c));
		}
		rep(i,8)
			printf("%d%c",res[i],i==7?'\n':' ');
	}

	return 0;
}