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.*;
import java.text.*;
import java.math.*;

public class main {
    public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static PrintWriter pw = new PrintWriter(System.out);
    public static String line;
    public static StringTokenizer st;
    public static ArrayList<ArrayList<Integer>> adjList;
    public static int[] dr = {-1, 0, 1, 0, -1, 1, 1, -1};
    public static int[] dc = {0, 1, 0, -1, 1, 1, -1, -1};

    public static int numBad(int n){
        int days = 0;
        days += (n / 7) * 2;
        days += Math.max(0, (n%7) - 5);
        return days;
    }

    public static void main(String[] args) throws Exception{
        int N = Integer.parseInt(br.readLine());

        int good = Math.min(N, 2);
        int bad = numBad(N);
        good += numBad(Math.max(0, N-2));
        pw.print(bad + " " + good + "\n");
        pw.close();
        br.close();
    }
}

class Pair implements Comparable<Pair>{
    public int n, i;

    Pair(int n, int i){
        this.n = n;
        this.i = i;
    }

    @Override
    public int compareTo(Pair P){
        return i - P.i;
    }
}
