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.Arrays;
import java.util.Scanner;
import java.util.regex.Pattern;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int min = Func(n,1);
        int max = min;
        for (int i = 1; i <= 7; i++) {
            int min1 = Func(n,i);
            if (min1 < min)
                min = min1;
            int max1 = Func(n,i);
            if (max1 > max)
                max = max1;
        }
        System.out.print(min);
        System.out.print(' ');
        System.out.println(max);
    }
    public static int Func(int n, int day){
        int holidays = 0;
        for (int i = 0; i < n; i++) {
            if (day == 6 || day == 7)
                holidays++;
            if (day == 7)
                day = 1;
            else
                day++;
        }
        return holidays;
    }
}
