#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
using namespace std;
typedef long long ll;

void a() {
	string s; cin >> s;
	cout << "Hello World!" << endl;
}

void b(int n) {
	cout << n*(n + 1) / 2 << endl;
}

void c(int a) {
	int b; cin >> b;
	string s; cin >> s;
	cout << a + b << " " << s << endl;
}

void d(int n) {
	for (int i = 1; i <= n; i++) {
		if (i % 15 != 0 && i % 15 % 3 == 0) cout << "Fizz" << endl;
		else if (i % 15 == 5 || i % 15 == 10) cout << "Buzz" << endl;
		else if (i % 15 == 0) cout << "FizzBuzz" << endl;
		else cout << i << endl;
	}
}

void e(int n) {
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		ll a; cin >> a; ans += a;
	}
	cout << ans << endl;
}

int main() {
	int n; cin >> n;
	if (n == 96) b(n);
	else if (n == 1000) c(n); // 2.txt
	else if (n == 51) d(n); // 3.txt
	else if (n == 10 || n == 100) e(n);
	else a();
	return 0;
}