#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
#include <unordered_map>

using namespace std;
typedef long long ll;

#define Cmp(a, b) memcmp(a, b, sizeof(b))
#define Cpy(a, b) memcpy(a, b, sizeof(b))
#define Set(a, v) memset(a, v, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define _forS(i, l, r) for(set<int>::iterator i = (l); i != (r); i++)
#define _rep(i, l, r) for(int i = (l); i <= (r); i++)
#define _for(i, l, r) for(int i = (l); i < (r); i++)
#define _forDown(i, l, r) for(int i = (l); i >= r; i--)
#define debug_(ch, i) printf(#ch"[%d]: %d\n", i, ch[i])
#define debug_m(mp, p) printf(#mp"[%d]: %d\n", p->first, p->second)
#define debugS(str) cout << "dbg: " << str << endl;
#define debugArr(arr, x, y) _for(i, 0, x) { _for(j, 0, y) printf("%c", arr[i][j]); printf("\n"); }
#define _forPlus(i, l, d, r) for(int i = (l); i + d < (r); i++)
#define lowbit(i) (i & (-i))
#define MPR(a, b) make_pair(a, b)

pair<int, int> crack(int n) {
    int st = sqrt(n);
    int fac = n / st;
    while (n % st) {
        st += 1;
        fac = n / st;
    }

    return make_pair(st, fac);
}

inline ll qpow(ll a, int n) {
    ll ans = 1;
    for(; n; n >>= 1) {
        if(n & 1) ans *= 1ll * a;
        a *= a;
    }
    return ans;
}

template <class T>
inline bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll ksc(ll a, ll b, ll mod) {
    ll ans = 0;
    for(; b; b >>= 1) {
        if (b & 1) ans = (ans + a) % mod;
        a = (a * 2) % mod;
    }
    return ans;
}

ll ksm(ll a, ll b, ll mod) {
    ll ans = 1 % mod;
    a %= mod;

    for(; b; b >>= 1) {
        if (b & 1) ans = ksc(ans, a, mod);
        a = ksc(a, a, mod);
    }

    return ans;
}

template <class T>
inline bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool lexSmaller(vector<T> a, vector<T> b) {
    int n = a.size(), m = b.size();
    int i;
    for(i = 0; i < n && i < m; i++) {
        if (a[i] < b[i]) return true;
        else if (b[i] < a[i]) return false;
    }
    return (i == n && i < m);
}

// ============================================================== //

typedef unsigned long long ull;
typedef pair<ull, int> PII;
const int maxn = 40000 + 10;
char str[maxn];
const int P = 131;
ull h[maxn], p[maxn];
int n, m, pos;

void prework() {
    p[0] = 1;
    for (int i = 1; i <= n; i++) {
        h[i] = h[i-1] * P + str[i] - 'a' + 1;
        p[i] = p[i-1] * P;
    }
}

ull get(int l, int r) {
    return h[r] - h[l-1] * p[r-l+1];
}

int check(int L, int &pos) {
    pos = -1;
    PII a[maxn];
    for (int i = 1; i <= n-L+1; i++) {
        ull x = get(i, i+L-1);
        a[i] = make_pair(x, i);
    }
    sort(a+1, a+n-L+2);

    int cnt = 0;
    for (int i = 1; i <= n-L+1; i++) {
        if (i == 1 || (a[i].first != a[i-1].first)) cnt = 0;
        if (++cnt >= m) pos = max(pos, a[i].second);
    }

    return pos > 0;
}

void solve() {
    int pos = -1;
    if (!check(1, pos)) {
        puts("none");
        return;
    }

    int l = 1, r = n;
    while (l < r) {
        int mid = (l + r + 1) >> 1;
        if (!check(mid, pos)) r = mid - 1;
        else l = mid;
    }
    // l is the answer
    check(l, pos);
    printf("%d %d\n", l, pos-1);
    return;
}

int main() {
    freopen("input.txt", "r", stdin);
    while (scanf("%d", &m) == 1 && m) {
        scanf("%s", str+1);
        n = strlen(str+1);

        // then prework
        prework();
        // then solve
        solve();
    }
}