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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        try {
            int n = Integer.parseInt(br.readLine());
            int min = 0;

            min = (int)Math.floor((double)n/7) * 2;
            int temp = n % 7 ;

            if (temp == 0) {
                System.out.print(min + " ");
                System.out.println(min);
            }
            else if (temp == 1) {
                System.out.print(min + " ");
                System.out.println(min + 1);
            }
            else if (temp == 6) {
                System.out.print((min + 1) + " ");
                System.out.println((min + 2));
            }
            else {
                System.out.print(min + " ");
                System.out.println((min + 2));
            }

        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
