#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

using namespace std;

int aint[400000], v[100001];

void build ( int nod, int st, int dr )
{
    int m;
    if ( st == dr )
        aint [nod] = v[st];
    else
    {
        m = ( st + dr ) / 2;
        build ( 2 * nod, st, m );
        build ( 2 * nod, m + 1, dr );
        aint[nod] = max ( aint[2 * nod], aint[2 * nod + 1] );
    }
}

int main()
{
    cout << "Hello world!" << endl;
    return 0;
}