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.*;
import java.lang.*;
import java.io.*;
import java.lang.Math;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static void main (String[] args) 
	{
	//	n = int(input())
//a = n//7
//b = n%7
//mi = 2*a + max(b-5,0)
//ma = 2*a + min(b,2)
//print(mi,ma)
		// your code goes here
		
		Scanner sc = new Scanner (System.in);
		int n = sc.nextInt();
		int a = (n/7);
		int b = (n%7);
		int mi = 2*a + Math.max(b-5,0);
		int ma = 2*a + Math.min(b,2);
		System.out.printf(mi+" "+ma);
	}
}