#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;


template <typename T>
std::vector <T> GaussianElimination(std::vector <std::vector <T> > A,std::vector <T> b){//pivot selection

  for(int k = 0; k < A.size();k++){
    T u_max = A[k][k];
    T u_maxindex = k;
    for(int i = k+1; i < A.size();i++){
      if(u_max < A[i][k]){
        u_max = A[i][k];
        u_maxindex = i;
      }
    }
    std::swap(A[k],A[u_maxindex]);
    std::swap(b[k],b[u_maxindex]);
    T u = A[k][k];
    A[k][k] = 1;
    for(int j = k+1;j < A.size();j++){
      A[k][j] = A[k][j] / u;
    }
    b[k] /= u;

    for(int i = k+1;i < A.size();i++){
      T u = A[i][k];
      A[i][k] = 0;
      for(int j = k+1;j < A.size();j++){
        A[i][j] -= u * A[k][j];
      }
      b[i] -= u * b[k];
    }
  }
  std::vector <T> x(A.size());
  for(int i = A.size()-1;i>=0;i--){
    T other = 0;
    for(int j = i+1;j < A.size();j++){
      other += A[i][j] * x[j];
    }
    b[i] -= other;
    x[i] = b[i] / A[i][i];
  }
  return x;
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int N;

  cin >> N;
  vector <int> nums(N);
  vector <vector <int> > A(N,vector <int>(N,1));
  rep(i,N){
    cin >> nums[i];
    A[i][i] = 0;
  }
  vector <int> x = GaussianElimination(A,nums);
  cout << count(ALL(x),2) << " " << count(ALL(x),4) << endl;
  return 0;
}