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 Q1Rubika {

    public static void main(String[] args) {
        long min, max;
        long noOfDays;
        Scanner sc = new Scanner(System.in);

        //System.out.println("Enter number of days(values from 1 to 10000)..Enter -1 to exit");
        noOfDays = sc.nextInt();
        //do {
            if (noOfDays % 7 == 6) {
                min = (noOfDays / 7) * 2 + 1;
            } else {
                min = (noOfDays / 7) * 2;
            }
            //System.out.println("Min number of holidays - " + min);
            if (noOfDays <= 2) {
                max = noOfDays;
            } else {
                if ((noOfDays - 2) % 7 == 6) {
                    max = 2 + 1 + ((noOfDays - 2) / 7) * 2;
                } else {
                    max = 2 + ((noOfDays - 2) / 7) * 2;
                }

            }
            //System.out.println("Max number of holidays - " + max);
            //System.out.println("Enter number of days");
            
            System.out.println(min + " " + max);
            //noOfDays = sc.nextInt();
        //} while (noOfDays != -1);
    }
}
