#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y-1);(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

int solve(vector<int> &a,vector<int> &b,int z){
  int n=a.size(),m=b.size(),re=0,j=0;
  for(re=0;re<n&&j<m;++j)
    if(a[re]<b[j])
      ++re;
  //cout<<re<<endl;
  m-=re;
  re+=min(m,z);
  if(m>z)
    re+=(m-z)/2;
  //cout<<re<<endl;
  return re;
}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int i,j,k;
  int n,a,z=0;
  cin>>n;
  vector<int> pos,neg;
  rep(i,2*n){
    cin>>a;
    if(a){
      if(a<0)neg.pb(-a);
      else pos.pb(a);
    }else ++z;
  }
  sort(all(pos)); sort(all(neg));
  //cout<<pos<<neg;
  cout<<solve(pos,neg,z)<<" "<<solve(neg,pos,z)<<" ";
  vector<int> cnt(112345);
  for(int a:pos)
    ++cnt[a];
  z/=2;
  for(int a:neg)
    if(cnt[a]){
      ++z; --cnt[a];
    }
  cout<<z<<endl;
  return 0;
}