#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n;
vector<ll> a;

void solve(){
	sort(a.begin(),a.end());
	for(auto &i:a)cerr<<i<<' ';cerr<<endl;
	for(int _ = 0;_ < 2; _++){
		for(int i = 0;i<n*2;i++)a[i] *= -1;
		set<int> ng,pg,zero;
		for(int i = 0;i<n*2;i++){
			if(a[i]<0)ng.insert(a[i]);
			else if(a[i]>0)pg.insert(a[i]);
			else zero.insert(a[i]);
		}
		int ans =0;
		for(auto &i:ng){
			auto it = pg.upper_bound(-i);
			if(pg.end()!=it){
				pg.erase(it);
				ans++;
			}
		}
		int zerocnt = zero.size();
		int pgcnt = pg.size();
		ans += min(zerocnt,pgcnt);
		pgcnt -= min(zerocnt,pgcnt);
		ans += pgcnt/2;
		cout<<ans<<' ';
	}
	map<ll,ll> mp;
	for(int i = 0;i<n*2;i++){
		mp[a[i]]++;
		mp[-a[i]]+=0;
	}
	ll ans =0;
	for(auto &i:mp){
		ans += min(i.second,mp[-i.first]);
	}
	cout<<ans/2<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	a = vector<ll>(n*2);
	for(auto &i:a)cin >> i;
	solve();
}