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 HelloWorld
{
    public static void main(String []args)
    {
        int y, mind, maxd, m, mod;
        Scanner in= new Scanner(System.in);
        y = in.nextInt();
        if (y == 1)
        {
            mind = 0;
            maxd = 1;
        }
        else if (y <= 5 && y >= 2)
        {
            mind = 0;
            maxd = 2;
        }
        else if (y == 6)
        {
            mind = 1;
            maxd = 2;
        }
        else if (y == 7)
        {
            mind = 2;
            maxd = 2;
        }
        else
        {
            mod  = y % 7;
    		m    = y / 7;
    		maxd = m * 2;
            mind = m * 2;
            if(mod == 1)
    		{
    			maxd = m*2+1;
            }
            else if(mod >= 2 && mod <= 5)
            {
    			maxd = m*2+2;
            }
            else if(mod == 6)
            {
    			maxd = m*2+2;
			    mind = m*2+1;
            }
        }
        System.out.print(mind + " " + maxd);
    }
}