#include <algorithm>
#include <array>
#include <sstream>
#include <cstdio>
#include <functional>
#include <cstdlib>
#include <cctype>
#include <ostream>
#include <complex>
#include <cmath>
#include <iostream>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <bitset>
#include <iomanip>
#include <string>
#include <vector>
#include <string>


using namespace std;
typedef long long ll; 

#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)

#define ANSWER(x) cout << (x) << endl;
#define DANSWER(x) cout << set_presicion(10) << (x) << endl;

#define pb push_back
#define mp make_pair
#define ALL(a) begin((a)),end((a))
#define INIT(a,n) for(auto &hoge : (a)) hoge = (n);
#define pii pair<int,int>
#define pss pair<string,string>
#define pis pair<int,string>
#define psi pair<string,int>
#define VS vector<string>
#define VI vector<int>
#define SUBSTR(s,i,l) string((s), (i), (l))
#define pi 2*acos(0.0)
#define eps 1e-14


int main()
{
    bool syoken[200];
    INIT(syoken, false);
    string aaa[20];
    INIT(aaa, "123456");
    sort(ALL(aaa));
    priority_queue<int,vector<int>,greater<int>> nmn;
    auto p = [](int x, int y) -> int {  return ( x < y );} ;
    //(less<int>)([](int x, int y) -> bool { return ( x < y );});
    priority_queue< int, vector<int>, less<int> >  kkkkkn;
    VI an;
    sort(begin(an),end(an), [](int x, int y) -> int{ return ( x < y );});
    int m = stoi(SUBSTR(aaa[0], 2, 4));
    ANSWER("Hello World!");
    return 0;
    
}