Bonboni

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int i, broj, counter=1, copyBroj;
    vector<int> vec1, vec2;
    cin >> broj;
    copyBroj = broj;
    for(i=0; broj>0; i++, counter*=3)
    {
        if(broj%3==1)vec1.push_back(counter);
        else if (broj%3==2)vec2.push_back(counter);
        if(broj%3==1)broj--;
        if(broj%3==2)broj++;
        broj/=3;
    }
    sort(vec1.begin(), vec1.end());
    sort(vec2.begin(), vec2.end());
    for(i=0; i<vec2.size(); i++)cout << vec2[i] << " ";
    cout << copyBroj << endl;
    for(i=0; i<vec1.size(); i++)cout << vec1[i] << " ";
    return 0;
}