#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>

using namespace std;

#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int i = 1; i <= (long long int)(n); i++)
#define drep(i, n, diff) for (long long int i = 0; i < (long long int)(n); i += diff)
#define mod 1000000007
#define INF 100100100100100101
#define cdeb(val) cout << #val << ":" << val << endl;
#define pdeb(val) printf("%s : %lld\n", #val, val);

typedef long long int ll;
typedef pair<ll, ll> P;
typedef pair<P, P> PP;
typedef tuple<ll, ll, ll> TP;

int main() {
  ll a, b, c;
  cin >> a >> b >> c;
  if ((a*a) + (b*b) < (c*c)) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}

/*Bismillahi-r-Rahmani-r-Rahim*/
#include<bits/stdc++.h>
using namespace std;
#define  ll         long long
#define  pi         acos(-1.0)
#define  mod        1000000007
#define  yes        cout<<"YES"<<endl
#define  no         cout<<"NO"<<endl
#define  vi         vector<int>
#define  vl         vector<ll int>
#define  pb         push_back
#define  test       cin>>t;while(t--)
#define  lcm(a,b)   a*b/__gcd(a,b)
#define  sd         second
#define  ft         first
#define  rep(i,a,b) for(i=a;i<b;i++)

int main()
{
     ios_base::sync_with_stdio(false);cin.tie(NULL);
     ll int i,n,t,j=0,p,x,l=0,r=0,y,k,c,sum=0,m,d,cnts=0;

         cin>>n;
         x=pow(2,n);
         l=pow(2,n-1);
         vi a(x);
         rep(i,0,x){
         cin>>a[i];
         }
         c=0;
         rep(i,0,l){
         if(c<a[i]){
            c=a[i];
            r=i+1;
         }
        }
        d=0;
        rep(i,l,x){
            if(d<a[i]){
                d=a[i];
                k=i+1;
            }
           // cout<<a[i];
        }

        if(d<c){
            cout<<k<<endl;
        }
        else{
            cout<<r<<endl;
        }











}
