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 Ishu

{
    
	public static void main(String[] args)
    
	{
        
	 Scanner scan=new Scanner(System.in);    
 
	 int n,i,m,d,r,a,b,min,max;
	 int[] arr=new int[7];
	 n=scan.nextInt();
	 if(n==1)
		System.out.println(0+" "+1);
	 else if(n>=2&&n<=5)
		System.out.println(0+" "+2);
	 else if(n==6)
		System.out.println(1+" "+2);
	 else
	    {
	      for(i=0;i<7;++i)
		{
		 m=n;
		 m-=(7-i);
		 if(i==6)
			++arr[i];
		 else
			arr[i]+=2;
		 d=m/7;
		 arr[i]+=d*2;
		 r=m%7;
		 if(r==6)
			++arr[i];
		}
		 min=max=arr[0];
		 for(i=0;i<7;++i)
			{
			 if(arr[i]<min)
				min=arr[i];
			 if(arr[i]>max)
				max=arr[i];
			}
		 System.out.println(min+" "+max);
	    }
	}
}