【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

注意当n小于2的情况

代码如下：

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