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;

/**
* 2nd
*/
public class Q1Ujitha {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        //System.out.println("Input :");
        int n = sc.nextInt();
        //System.out.println("Output :");
        System.out.println(getMinPossibleHolidays(n) + " " + getMaxPossibleHolidays(n));

    }

    public static int getMaxPossibleHolidays(int n) {
        int maxPossible = 2;
        int i = 1;
        if (n==1)
            return 1;
        do {
            i += 7;
            if (i == n) {
                maxPossible += 1;
                break;
            } else if (i < n) {
                maxPossible += 2;
            }

        } while (i <= n);
        return maxPossible;
    }

    public static int getMinPossibleHolidays(int n) {
        int minPossible = 0;
        int i = 6;


        do {
            if (i == n) {
                minPossible += 1;
                break;
            } else if (i < n) {
                minPossible += 2;
            }
            i += 7;
        } while (i <= n);
        return minPossible;
    }
}