2진수 8진수

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <cmath>
using namespace std;



int main() {
	freopen("input.txt", "rt", stdin);
	string n;
	cin >> n;
	int s = n.length();
	
	int cnt = 0;
	int sum = 0;
	vector<int> v;
	for (int i = s - 1; i >= 0; i--) {
		sum = sum + (n[i] - '0') * pow(2, cnt);
		cnt++;
		if (cnt == 3 || i==0) {
			v.push_back(sum);
			cnt = 0;
			sum = 0;
		}
	}
	for (int i = v.size()-1; i >=0; i--) {
		printf("%d", v[i]);
	}
	


	return 0;
}