#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
//индексация с нуля
int main()
{ vector <int> data = {0,0,0,0,0};
int n =4,radix = 3,idx=0,cnt=1,j,k;
cin>>idx;
label:
while (cnt <= pow(radix, n)){//1<=81
cnt = cnt +1; //cnt=2 cnt=3
j = n;//j = 4
label1:
if(j >=1){ //4>1
if(data[j]<radix-1){//0<2
data[j] = data[j]+1;//data[4] = 1

if(j<n && (data[j+1] == (radix -1))){
k = j+1;
while(k<=n){
data[k] =0;
k = k+1;
}}

if(cnt == idx) {
for(int c:data) cout << c <<' ';
cout<<endl;
return 0;
}
else goto label;
}
else {j = j-1;
    goto label1;
}//3

}
else goto  label;
}
return 0;
}