#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,j,n) for(ll i=j;i<(ll)(n);i++)
#define rrep(i,j,n)  for(ll i=j;i>=n;i--)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define pb push_back
#define mp make_pair
#define perm(c) sort(all(c)); for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define UNIQUE(v) sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end())

using namespace std;
using namespace atcoder;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b){if(a<b) {a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b){if(a>b) {a=b;return 1;}return 0;}

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}

void yn(bool ok){
    if(ok)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}

ll modPow(ll x, ll a,ll m) {
    if (a == 0) return 1;
    if (a == 1) return x;
    if (a % 2) return (x * modPow(x, a - 1,m)) % m;
    long long t = modPow(x, a / 2,m);
    return (t * t) % m;
}

long long modInv(ll x,ll m) {
    return modPow(x, m - 2,m);
}

void solve(){
    cout << "Hello World!" << endl;
}

int main(){
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    ll T;
    T = 1;
    /*
       cin >> T;
       */
    while(T--) solve();
}