Codeforces Round 350 (Div. 2)
A
Holidays
Codeforces
900
原题
←B →
翻译中…

On the planet Mars a year lasts exactly $*n*$ days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5 work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.

翻译中…

Input

翻译中…

The first line of the input contains a positive integer $*n*$ ($1 ≤ *n* ≤ 1 000 000$) — the number of days in a year on Mars.

翻译中…

Output

翻译中…

Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.

翻译中…

Note

翻译中…

In the first sample there are $14$ days in a year on Mars, and therefore independently of the day a year starts with there will be exactly $4$ days off .

翻译中…

In the second sample there are only $2$ days in a year on Mars, and they can both be either work days or days off.

翻译中…

样例

Input #1
14
Output #1
4 4
InputCopy OutputCopy
Input #2
2
Output #2
0 2
InputCopy OutputCopy
题目信息
题号
670A
时间限制
1 s
内存限制
256 MB
标签
暴力
构造
贪心
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。