///G. Hagopian working Collatz conjecture
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int collatz(int n) {
    if(n%2==0) return n/2;
    return 3*n+1;
}

int hagopianz(int n) {
    if(n%5==0) return (n/5)*6;
    if(n%5==1) return ((n-1)/5)*6;
    if(n%5==2) return ((n-2)/5)*4;
    if(n%5==3) return ((n+2)/5)*2;
    if(n%5==4) return ((n+1)/5)*7;
}

bool isIn(vector<int> vi, int i) {
    return find(vi.begin(), vi.end(), i) != vi.end();
}

int main() {
    vector<int> results;
    for(int i = 60; i<100; ++i) {
        int n = i;
        results.clear();
        do {
            results.push_back(n);
            //cout << n;
            n=hagopianz(n);
        } while(!isIn(results,n));
        for(int j:results) cout << j << " ";
        cout << endl << endl;
        cin.get();
    }
}