#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int solve1( VI as )
{
	const int N = SZ( as );
	sort( ALL( as ) );

	VI used( N );

	int res = 0;
	for ( int i = 0, j = N - 1; i < N && as[i] <= 0; ++i )
	{
		if ( as[j] <= -as[i] )
		{
			continue;
		}

		for ( ; i + 1 < j && as[ j - 1 ] < as[j] && 0 < as[i] + as[ j - 1 ]; --j );
		++res;
		used[i] = 1;
		used[j] = 1;

		--j;
	}

	int cnt = 0;
	REP( i, N )
	{
		cnt += 0 < as[i] && !used[i];
	}

	return res + cnt / 2;
}

int solve2( const VI &as )
{
	map< int, int > counts;
	for_each( ALL( as ), [&]( const int a ){ ++counts[a]; } );

	int res = 0;
	FOR( p, counts )
	{
		if ( 0 <= p.fst )
		{
			break;
		}

		res += min( p.snd, counts[ -p.fst ] );
	}
	return res + counts[0] / 2;;
}

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int N;
	cin >> N;

	VI as( 2 * N );
	cin >> as;

	VI bs;
	transform( ALL( as ), BI( bs ), negate< int >() );

	cout << solve1( bs ) << ' ' << solve1( as ) << ' ' << solve2( as ) << endl;

	return 0;
}