Submit solution

Points:
3

Time limit:
1.0s

Memory limit:
32M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Slavko is learning about different numeral systems. Slavko is not the brightest when it comes to math, so he is starting out converting binary numerals to octal. The algorithm Slavko uses is this:

- Pad the binary numeral with zeros on the left until the number of digits is divisible by three.
- Group adjacent binary digits into groups of digits.
- Replace each group of binary digits with the corresponding octal digit (as in the table on the right).

Write a program that converts a binary numeral to octal so that Slavko can verify his results.

000 | 0 |

001 | 1 |

010 | 2 |

011 | 3 |

100 | 4 |

101 | 5 |

110 | 6 |

111 | 7 |

#### Input Specification

The input contains a binary numeral. The number of digits will be less than , and the first digit will be .

#### Output Specification

Output the number in octal.

#### Sample Input 1

`1010`

#### Sample Output 1

`12`

#### Sample Input 2

`11001100`

#### Sample Output 2

`314`

## Comments