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.

题意：一年有 n 天，问最多有多少天假期（max）and 最多有多少假期（min）

题解：只需列举几个简单的数的ans，即可找到规律。

#include<stdio.h>
#include<string.h> 
#include<math.h>
#include<iostream>
#include<algorithm>
#define LL long long

using namespace std;
const int  max_n=1e5+5;

int n,maxans,minans;

int main() 
{
	while(scanf("%d",&n)==1)
	{
		minans=maxans=(n+6)/7*2;
		if(n%7>=1&&n%7<=5)minans=maxans-2;
		if(n%7==6)minans=maxans-1;
		if(n%7==1)maxans--;
		printf("%d %d\n",minans,maxans);	
	}
	return 0;
}