Codeforces Round#350(Div. 2) 670A Holidays

问题描述

A. Holidays

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.

Examples

Input
14

Output
4 4

Input
2

Output
0 2

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.

AcceptedCode

#include
#include
using namespace std;
int minn[1000010]={0,0,0,0,0,0,1,2};
int maxx[1000010]={0,1,2,2,2,2,2,2};
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=8;i<=n;i++)
        {
            minn[i]=minn[i-7]+2;
            maxx[i]=maxx[i-7]+2;
          //  printf("%d %d\n",minn[i],maxx[i]);
        }
        printf("%d %d\n",minn[n],maxx[n]);
    }

}

找规律。打表，输出。。