【codeforces】-#670A- Holidays

点击打开题目

A. Holidays

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 4days 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.

计算假期的最小值，最大值

#include<cstdio>
int main()
{
	int n,y;
	int m=1;
	scanf("%d",&n);
	y=n/7;
	n=n%7;
	while(m--)
	{
		if(n>5)
			printf("%d\n",2*y+n-5);			//小 
		else
			printf("%d\n",2*y);
	}
	m=1;
	while(m--)
	{
		if(n>2)
			printf("%d\n",2*y+2);
		else
			printf("%d\n",2*y+n);
	}
	return 0;
}