#include <iostream>

#include <algorithm>
struct vector
{
int* a;
int n;
};
void init(vector* v,int n=10)
{
v->n=n;
v->a=new int[n];
}
void del(vector* v)
{
delete[] v->a;
v->n=0;
}
void chanhe_size(vector* v,int n)
{
v->n=n;
v->a=new int[n];
}
int at(vector* v,int i)
{
return v->a[i];
}
int sumciot(vector* v)
{
int s=0;
for(int i=0;i<v->n;i++)
{
if(v->a[i]%2==0)
s+=v->a[i];
}
return s;
}
int main()
{
vector v;
init(&v,5);
for(int i=0;i<5;i++)
std::cin>>v.a[i];
std::cout<<std::max_element(v.a,v.a+v.n)-v.a+1;
}