Buying Keys
题号:NC54750
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

One day Xiao Ming is not happy because he has no idea about how to run out of his pocket money. At that moment, a mysterious man appears with a smile:"My keys are on sale, three yuan can buy a key, ten yuan can buy three keys.How many keys do you wanna buy?" 
Xiaoming is attracted by mysterious man and wants to spend all his money on buying keys. He doesn't want keep any money at the end. At the same time, because of the heavy weight of keys, Xiaoming Hopes that he can buy as few keys as possible. At the beginning, Xiao Ming had n yuan. Can you tell Xiaoming the minimum number of keys he can bought if he runs out of his pocket money?If Xiaoming can't run out of his money, please output "orz".

输入描述:

The first line contains one integer n(1 ≤n ≤1e9), the pocket money Xiaoming have.

输出描述:

If Xiaoming can't run out of his money, please output "orz", otherwise output the minimum number of keys he can bought if he runs out of his money.
示例1

输入

复制
3

输出

复制
1
示例2

输入

复制
11

输出

复制
orz

说明

It's impossible to run out of his money.