#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cout << a << ' '; err(x...); }
#else
#define dbg(...)
#endif
typedef long long ll;
typedef pair<int,int> pi;
typedef vector<int> vi;
template<class T> using vc=vector<T>;
template<class T> using vvc=vc<vc<T>>;
template<class T> void mkuni(vector<T>&v)
{
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
ll rand_int(ll l, ll r) //[l, r]
{
    static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
    return uniform_int_distribution<ll>(l, r)(gen);
}
template<class T>
void print(T x,int suc=1)
{
    cout<<x;
    if(suc==1) cout<<'\n';
    else cout<<' ';
}
template<class T>
void print(const vector<T>&v,int suc=1)
{
    for(int i=0;i<v.size();i++)
    print(v[i],i==(int)(v.size())-1?suc:2);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n;
    cin>>n;
    ll t=1000;
    int cc=1;
    ll ans=0;
    while(t*1000<=n)
    {
        ans+=cc*(t*1000-t);
        t*=1000;
        cc++;
    }
    if(n>=t)
        ans+=(n-t+1)*cc;
    print(ans);
}
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(pow(2, n) / 2);
    vector<int> b(pow(2, n) / 2);
    for (int i = 0; i < pow(2, n) / 2; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < pow(2, n) / 2; i++) {
        cin >> b[i];
    }
    int maxElementA = *std::max_element(a.begin(), a.end());
    int maxElementB = *std::max_element(b.begin(), b.end());
    if(maxElementA > maxElementB) {
        cout << max_element(b.begin(),b.end()) - b.begin() + a.size() + 1 << endl;
    } else {
        cout << max_element(a.begin(),a.end()) - a.begin() + 1 << endl;
    }
}