#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 27;
const double EPS = 1e-10;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)

int R;
double x[200], y[200], r[200], v[200];
double dis[200];
bool used[200];

int main(){
	int a[5];
	while(cin >> a[0] && a[0]){
		rep2(i, 1, 5) cin >> a[i];
		rep(i, 5){
			int w = 0;
			int l = 0;
			rep(j, 5){
				if(i == j) continue;
				if((a[i] + 1) % 3 == a[j] % 3) w++;
				if((a[j] + 1) % 3 == a[i] % 3) l++;
			}
			if(w > 0 && l == 0) cout << 1 << endl;
			else if(w == 0 && l > 0) cout << 2 << endl;
			else cout << 3 << endl; 
		}
	}
	return 0;
}