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 A {
	public static void main(String args[]){
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int n1 = n;
		int count = 0 ;
		while(n1>0){
			if(n1>=7){
				count+=2;
				n1-=7;
			}else{
				if(n1<=5){
					n1=0;
				}else{
					n1-=5;
					count+=n1;
					n1=0;
				}
			}
		}
		System.out.print(count+" ");
		n1 = n ;
		count = 0;
		while(n1>0){
			if(n1>=7){
				count+=2;
				n1-=7;
			}else{
				if(n1>=2){
					n1=0;
					count+=2;
				}else{
					count+=n1;
					n1=0;
				}
			}
		}
		System.out.println(count);
	}
}
