CodeForces670AHolidays

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

代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int q,w;
		q=n/7;
		w=n%7;
		int min,max;
		if(w<=5)
		{
			min=2*q;
			if(w<=2)
			{
				max=2*q+w;
			}
			else
			{
				max=2*q+2;
			}
		}
		else
		{
			min=2*q+(w-5);
			max=2*q+2;
		}
		printf("%d %d\n",min,max);
	}
	return  0;
}

思路：每一星期必有两天假期，所以先判断有多少个星期，在判断剩余天数不大于五的话最小可以没有假期，小于等于二的话最多就只有剩余天数假期，大于五的话，最少有剩余天数减五的假期！