#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
const int N = 2e5+5;
using namespace std;
int a[N];
int main()
{
	int n;
	cin>>n;
	int m = pow(2,n);
	for(int i=0;i<m;i++){
		cin>>a[i];	
	}
	int lmax = 0,rmax = m/2;
	for(int i=0;i<m/2;i++){
		if(a[lmax]<a[i]) lmax = i;
	}
	for(int i=m/2;i<m;i++){
		if(a[rmax]<a[i]) rmax = i;
	}
	if(a[lmax]<a[rmax]) printf("%d",lmax+1);
	else printf("%d",rmax+1);
	return 0;
} 
// Problem: A - Maxi-Buying
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: tooler!
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll rd() {
	ll x=0,f=1;
	char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c))x=x*10+c-'0',c=getchar();
	return x*f;
}
#define d rd()
#define pb push_back
double x;
int main(){
	cin>>x;
	x*=1.08;
	if((int)x<206)cout<<"Yay!";
	else if((int)x==206)cout<<"so-so";
	else cout<<":(";
	return 0;
}