CF670A.Holidays

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The first line of the input contains a positive integer $n$ ( $1<=n<=1000000$ ) — the number of days in a year on Mars.

输出格式

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

输入输出样例

输入#1
```
14
```
输出#1
```
4 4
```
输入#2
```
2
```
输出#2
```
0 2
```

说明/提示

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.

首页