#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    string s;
    cin >> s;

    if (s[0] - '0' > 9) {
        cout << "Hello World!\n";
        return 0;
    }

    int n = (int)stoi(s);

    vector <ll> vec;
    while (cin) {
        cin >> s;
        if (s[0] - '0' > 9) {
            break;
        }
        vec.push_back((ll)stoi(s));
    }

    if (vec.size() == 0) {
        for (int i = 1; i <= n; i++) {
            if (i % 15 == 0) {
                cout << "FizzBuzz\n";
            } else if (i % 3 == 0) {
                cout << "Fizz\n";
            } else if (i % 5 == 0) {
                cout << "Buzz\n";
            } else {
                cout << i << "\n";
            }
        }
    } else if (vec.size() == 1) {
        cout << n + vec[0] << " " << s << "\n";
    } else {
        ll ans = 0;
        for (ll x : vec) ans += x;
        cout << ans << "\n";
    }


//    cin >> n;
//    ans = 0;
//    for (int i = 1; i <= n; i++) ans += i;
//    cout << ans << "\n";

    return 0;
}