#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define fi first
#define se second
#define vi vector<int>
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef std::pair<int,int> pii;

using namespace std;


int main(){
    int n;cin>>n;
    rep(i,'b'-'a',n+'b'-'a'){
        bool f=false;
        if(i%('d'-'a')=='a'-'a'){
            cout<<"Fizz";
            f=true;   
        }
        if(i%('f'-'a')=='a'-'a'){
            cout<<"Buzz";
            f=true;   
        }
        if(!f)cout<<i;
        cout<<endl;
    }

    
    return 'a'-'a';
}