#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;

#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
#define mkp make_pair

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
static const int INF=1<<24;

template <class T>
void initvv(vector<vector<T> > &v,int a,int b, const T  &t = T()){
	v.assign(a,vector<T>(b,t));
}

//v.erase(unique(v.begin(),v.end()),v.end());


int main(){
	double a,b;
	vector<vint> vv;
	initvv(vv,4,2);
	rep(i,4){
		rep(j,2){
			vv[i][j]=0;
		}
	}
	vector<double> v(2);
	while(cin>>v[0]){
		cin>>v[1];
		rep(i,2){
			if(v[i]>=1.1){
				vv[0][i]++;
			}
			else if(v[i]>=0.6){
				vv[1][i]++;
			}
			else if(v[i]>=0.2){
				vv[2][i]++;
			}
			else{
				vv[3][i]++;
			}
		}

	}
	rep(i,4){
		rep(j,2){
			if(j){
				cout<<" ";
			}
			cout<<vv[i][j];
		}
		cout<<endl;
	}
}