#B. 蜗牛爬树

    Type: FileIO (woniu) 1000ms 256MiB

蜗牛爬树

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

说明

有一棵葡萄树高nn分米,一只蜗牛从底部向上爬,每分钟爬33分米,但每爬一分钟后都要休息一分钟,休息期间又要滑下11分米。该蜗牛需要多少分钟才能爬到树顶?

输入格式

输入一个整数n(0n1000 \le n \le 100

输出格式

输出一个整数,表示蜗牛需要多少分钟才能爬到树顶。

样例

17
15

昆工附中5月24日Python测试

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
5
Start at
2024-5-24 16:30
End at
2024-5-24 18:30
Duration
2 hour(s)
Host
Partic.
21