【CodeForces 670A】Holidays（水题）

Description

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.

Sample Input

Input

14

Output

4 4

Input

2

Output

0 2

题目大意

给你一个工作和休息的规则：一个星期7天，工作5天休息两天。给你一个天数，问你最少休息几天和最大休息几天。

思路

水题

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n;

int main()
{
    while(~scanf("%d",&n))
    {
        int ansn=0,ansx=0;
        int tempa=n;
        int tempb=n;
        while(tempa>0)
        {
            if(tempa<=1) ansx+=1;
            else ansx+=2;
            tempa-=7;
            if(tempa<=0) break;
        }
        while(tempb>0)
        {
            tempb-=5;
            if(tempb<=0) break;
            if(tempb<=1) ansn+=1;
            else ansn+=2;
            tempb-=2;
            if(tempb<=0) break;
        }
        printf("%d %d\n",ansn,ansx);
    }
    return 0;
}