#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

const int nmax = 100005;
const int lmax = 18;

int n, i, p, lim, maxi, cnt;
int suff[lmax][nmax];
char s[nmax];

struct piece
{
    int x, y;
};
piece l[nmax];

void build()
{
    for(i = 1; i <= n; i++)
        suff[0][i] = s[i];

    for(lim = 1, p = 1; p <= n; lim++, p *= 2)
    {
        for(i = 1; i <= n; i++)
        {
            l[i].x = suff[lim - 1][i];
            l[i].y = (i + p <= n) ? suff[lim - 1][i + p] : 0;
        }
    }
}

int main()
{
    freopen("prefix2.in", "r", stdin);
    freopen("prefix2.out", "w", stdout);

    n = 100000;
    for(i = 1; i <= n; i++)
        s[i] = 'a';
    build();

    return 0;
}