#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

//* Template 1 : 

int consistency1(int n){
	
	unordered_map<int,int> mp;
	
	int s = 0, e = 0;
	int distinct = 0;
	
	int ans = 0;
	
	while(e<n){
		mp[a[e]]++;
		if(mp[a[e]] == 1) distinct++;
		
		if(distinct == e-s+1){
			ans = max(ans, e-s+1);
			e++;
		}
		else{
			while(s<=e && distinct < e-s+1){
				mp[a[s]]--;
				if(mp[a[s]] == 0){
					distinct--;
					mp.erase(a[s]);
				}
				s++;
			}
			ans = max(ans, e-s+1);
			e++;
		}
		
	}

	return ans;
}







//* Template 2 : 

int consistency2(int n){
	
	unordered_map<int,int> mp;
	
	int s = 0, e = 0;
	int distinct = 0;
	
	int ans = 0;
	
	while(e<n){
		mp[a[e]]++;
		if(mp[a[e]] == 1) distinct++;
		
		while(s<=e && distinct < e-s+1){
			mp[a[s]]--;
			if(mp[a[s]] == 0){
				distinct--;
				mp.erase(a[s]);
			}
			s++;
		}
		ans = max(ans, e-s+1);
		e++;
		
	}

	return ans;
}





//* Maintaining Trick 

int consistency3(int n){
	
	unordered_map<int,int> mp;
	
	int s = 0, e = 0;
	
	int ans = 0;
	
	while(e<n){
		
		while(s<=e && mp.count(a[e])){
			mp[a[s]]--;
			if(mp[a[s]] == 0)	mp.erase(a[s]);
			s++;
		}
		mp[a[e]]++;
		ans = max(ans, e-s+1);
		e++;
	}

	return ans;
}




//* Maintaining Trick 

int consistency4(int n){
	
	unordered_map<int,int> mp;
	
	int s = 0, e = 0;
	
	int ans = 0;
	
	while(e<n){
		
		if(mp.count(a[e])){
			int j = mp[a[e]];
			
			while(s<=j){
				mp.erase(a[s]);
				s++;
			}
		}
		mp[a[e]] = e;
		ans = max(ans, e-s+1);
		e++;
	}

	return ans;
}




















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n) << " " << consistency2(n) << " " << consistency3(n) << " " << consistency4(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}