#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
using namespace std;
int main() {
int n, k=0, l=0;
cin>>n;
int ido1[n], ido2[n];
for(int i=0;i<n;i++){
cin>>ido1[i];
k+=ido1[i];
}
for(int i=0;i<n;i++){
cin>>ido2[i];
l+=ido2[i];
}
if(k>l){
cout<<"Hamilton";
}else{
cout<<"Verstappen";
}
cout<<endl;
sort(ido1, ido1+n);
sort(ido2, ido2+n);
if(ido1[0]>ido2[0]){
cout<<"Hamilton";
}else{
cout<<"Verstappen";
}
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
subtask1 | 0/0 | ||||||
1 | Wrong answer | 3ms | 1880 KiB | ||||
2 | Wrong answer | 3ms | 2212 KiB | ||||
subtask2 | 0/10 | ||||||
3 | Wrong answer | 3ms | 2420 KiB | ||||
4 | Wrong answer | 3ms | 2304 KiB | ||||
5 | Wrong answer | 3ms | 2648 KiB | ||||
6 | Wrong answer | 3ms | 2588 KiB | ||||
subtask3 | 0/15 | ||||||
7 | Wrong answer | 3ms | 2584 KiB | ||||
8 | Wrong answer | 3ms | 2720 KiB | ||||
9 | Wrong answer | 2ms | 2800 KiB | ||||
10 | Wrong answer | 3ms | 2840 KiB | ||||
11 | Wrong answer | 3ms | 2912 KiB | ||||
subtask4 | 0/20 | ||||||
12 | Wrong answer | 3ms | 2912 KiB | ||||
13 | Wrong answer | 3ms | 2912 KiB | ||||
14 | Wrong answer | 3ms | 3156 KiB | ||||
15 | Wrong answer | 3ms | 3304 KiB | ||||
16 | Wrong answer | 3ms | 3476 KiB | ||||
17 | Wrong answer | 3ms | 3572 KiB | ||||
18 | Wrong answer | 3ms | 3520 KiB | ||||
19 | Wrong answer | 3ms | 3476 KiB | ||||
subtask5 | 0/55 | ||||||
20 | Wrong answer | 3ms | 3476 KiB | ||||
21 | Wrong answer | 3ms | 3616 KiB | ||||
22 | Wrong answer | 3ms | 3704 KiB | ||||
23 | Wrong answer | 3ms | 3540 KiB | ||||
24 | Wrong answer | 3ms | 3616 KiB | ||||
25 | Wrong answer | 3ms | 3596 KiB | ||||
26 | Wrong answer | 3ms | 3592 KiB | ||||
27 | Wrong answer | 3ms | 3592 KiB | ||||
28 | Wrong answer | 3ms | 3480 KiB |