#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  string nn; cin >> nn;
  if (isdigit(static_cast<unsigned char>(nn.front()))) {
    int n = stoi(nn);
    long long m;
    if (cin >> m) {
      string s; cin >> s;
      long long three;
      if (cin >> three) {
        // No.9008, No.9009
        long long sum = m + stoll(s) + three;
        FOR(i, 3, n) {
          long long a; cin >> a;
          sum += a;
        }
        cout << sum << '\n';
      } else {
        if (isdigit(static_cast<unsigned char>(s.front()))) {
          // No.9008, No.9009
          long long sum = m + stoll(s);
          cout << sum << '\n';
        } else {
          // No.9001
          cout << n + m << ' ' << s << '\n';
        }
      }
    } else {
      if (n == 96) {
        // No.480
        int ans = 0;
        FOR(i, 1, n + 1) ans += i;
        cout << ans << '\n';
      } else {
        // No.9002
        FOR(i, 1, n + 1) {
          if (i % 15 == 0) cout << "FizzBuzz";
          else if (i % 3 == 0) cout << "Fizz";
          else if (i % 5 == 0) cout << "Buzz";
          else cout << i;
          cout << '\n';
        }
      }
    }
  } else {
    // No.9000
    cout << "Hello World!\n";
  }
  return 0;
}