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.
import java.util.Scanner;
 public class A670
{
	public static void main(String args[])
	{
	int n;
	Scanner sc= new Scanner(System.in);
	n= sc.nextInt();
	int a,b;

	a=n/7;
	//int b;
	b=a*2;
	int c;
	c=n%7;
	int max,min;
	max= b;
	min=b;

	if(c==1)
	{
		max=b+1;
	}
	else if(c==6)
	{
		max=b+2;
		min= min+1;
	}
	else if(c==0)
	{
       max=max;
       min=min;
	}
	else 
	{
		max=b+2;
		
	}
	

	System.out.println(""+min+" "+max);
}




}