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 Solution {
    
    public static int isMin(int n) {
        if (n <= 5) return 0;
        else if (n == 6) return 1;
        else if (n == 7) return 2;
        else return 2 + isMin(n-7);
    }
    
    public static int isMax(int n) {
        if (n == 0) return 0;
        else if (n == 1) return 1;
        else if (n >= 2 && n <= 7) return 2;
        else return 2 + isMax(n - 7);
    }

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        System.out.println(isMin(n) + " " + isMax(n));
    }
}