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.io.*;
import java.util.*;

public class Problems {

    public static void main(String[] args) throws IOException {

        new Problems().run();
    }

    public void run() throws IOException{
    	Scanner sc = new Scanner(System.in);
		int days = sc.nextInt();
    	
		if (days == 1) {
			System.out.print(0 + " " + 1);
		} else if(days <= 5) {
			System.out.print(0 + " " + 2);
		} else if(days == 6) {
			System.out.print(1 + " " + 2);
		} else {
			int kaldyk = Math.min(2, days % 7);
			int max = (days/7) * 2 + kaldyk;
			int min = (days/7) * 2 + Math.max(0, (days%7 - 5));
			System.out.println(min + " " + max);
		}
        sc.close();       
    }
    
}