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

typedef long long ll;

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

int main(){
  double a;
  int A[2],B[2],C[2],D[2];
  rep(i,2) A[i] = B[i] = C[i] = D[i] = 0;

  while(1){
    rep(i,2){
      if(!(cin>>a)){
        printf("%d %d\n",A[0],A[1]);
        printf("%d %d\n",B[0],B[1]);
        printf("%d %d\n",C[0],C[1]);
        printf("%d %d\n",D[0],D[1]);
        return 0;
      }

      if(a >= 1.1){
        A[i]++;
      }
      else if(a >= 0.6){
        B[i]++;
      }
      else if(a >= 0.2){
        C[i]++;
      }
      else{
        D[i]++;
      }
    }
  }
}