#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 *******************************



string a;

//* Template 1 : 
//* 	Start with valid window 

int consistency1(int n, int k) {

	deque<int> up, down;
	
	int s = 0, e = 0;
	int ans = 0;
	
	while(e<n){
		while(!up.empty() && a[e] < a[up.back()]) up.pop_back();
		up.push_back(e);
		
		while(!down.empty() && a[e] > a[down.back()]) down.pop_back();
		down.push_back(e);
		
		
		int maxi = a[down.front()];
		int mini = a[up.front()];
		
		if(maxi - mini <= k){
			ans = max(ans, e-s+1);
			e++;
		}
		else{
			while(s<=e){
				int maxi = a[down.front()];
				int mini = a[up.front()];
				
				if(maxi - mini <= k) break;
				
				if(s == down.front()) down.pop_front();
				if(s == up.front()) up.pop_front();
				
				s++;
			}
			
			ans = max(ans, e-s+1);
			e++;
		}
		
	}
	
	return ans;
	
}




int consistency2(int n, int k) {

	deque<int> up, down;
	
	int s = 0, e = 0;
	int ans = 0;
	
	while(e<n){
		while(!up.empty() && a[e] < a[up.back()]) up.pop_back();
		up.push_back(e);
		
		while(!down.empty() && a[e] > a[down.back()]) down.pop_back();
		down.push_back(e);
		
		
		while(s<=e){
			int maxi = a[down.front()];
			int mini = a[up.front()];
			
			if(maxi - mini <= k) break;
			
			if(s == down.front()) down.pop_front();
			if(s == up.front()) up.pop_front();
			
			s++;
		}
		
		ans = max(ans, e-s+1);
		e++;
		
	}
	
	return ans;
	
}






















int practice(int n, int k){
	
	
}






void solve() {
    
    int k;
    cin >> k;
    
	cin >> a;
	int n = a.size();
    
    cout << consistency1(n, k) << " " << consistency2(n, k) << 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;
}