codeforce 350 A. 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 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.

题意：一个星期有7天，每个星期有2天周末，给你一些天数，求最小的周末和最大的周末；

#include<iostream> 
#include<cstdio>
using namespace std;
int main()
{
	int n;
	while(cin>>n)
	{
		int sum=n%7;
		int ansma=n/7*2,ansmi=n/7*2;
		if(sum==1)
		ansma+=1;
		else  if(sum>=2)
		ansma+=2;
		if(sum==6)
		ansmi+=1;
		printf("%d %d\n",ansmi,ansma);
	}
 }