CodeForces 670A Holidays 火星人的假期

A. Holidays( GO cf )

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.

题目：就是给你一个数字，判断周六周日的最多和最少天数。

思路：判断是不是 7 的整数倍，然后依次判断余数

代码参考：

#include<stdio.h>
#include<stdlib.h>
#define G 1000

int main() {
	int n,max,min,yu,k;
	while(scanf("%d",&n)!=EOF){
		k=n%7;//感觉思路挺复杂
		if(k==0){
			max=min=n/7*2;
			printf("%d %d\n",min,max);
		}
		else if(k<=2){
			max=n/7*2+k;
			min=n/7*2;
			printf("%d %d\n",min,max);
		}
		else if(k<=6){
			max=n/7*2+2;
			if(k<6)
			min=n/7*2;
			else
			min=n/7*2+1;
			printf("%d %d\n",min,max);
		}
 	}
	return 0;
}