#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
using ull = unsigned long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> v((n+n+n)*(n+n+n));
    v[n+n]++;
    v[n+n]++;
    v[n+n]++;
    v[n+n+n]++;
    v[n+n+n]++;
    v[n+n+n]++;
    v[n+n+n]++;
    v[n+n+n]++;
    v[n]++;
    for(int i=v[n];i<=n;i++){
        if(!(i%v[n+n])&&!(i%v[n+n+n])){
            printf("Fizzbuzz\n");
        }
        else if(!(i%v[n+n])){
            printf("Fizz\n");
        }
        else if(!(i%v[n+n+n])){
            printf("Buzz\n");
        }
        else{
            printf("%d\n",i );
        }
    }
}