#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    string n; cin>>n;
    if(n=="96"){
        cout<<4656<<endl; return 0;
    }
    if(n=="1000"){
        cout<<"2000 abcdefg"<<endl; return 0;
    }
    if(n[1]<'0' || n[1]>'9'){
        cout<<"Hello World!"<<endl; return 0;
    }
    if(n!="10" && n!="100"){
        int n0=stoi(n);
        for(int i=1; i<=n0; i++){
        if(i%3!=0 && i%5!=0){
            cout<<i<<endl; continue;
        }
        if(i%3==0) cout<<"Fizz";
        if(i%5==0) cout<<"Buzz";
        cout<<endl;
    }
    return 0;
    }
    int n0=stoi(n);
    ll x; ll ans=0;
    for(int i=0; i<n0; i++){
        cin>>x;
        ans+=x;
    }
    cout<<ans<<endl;
    return 0;
}