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 ProblemSolver {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		System.out.println(minimum(n));
		System.out.println(maximum(n));
 	}
	
	private static int minimum(int n) {
		int sevenTimes = n / 7;
		int last = 0;
		if ( n - sevenTimes * 7 >= 6) {
			last = (n - sevenTimes*7) % 5;
		} return 2*sevenTimes + last;
	}
	
	private static int maximum(int n) {
		int sevenTimes = n / 7;
		int first = 0;
		if (n - sevenTimes * 7 < 2) {
			first = n - sevenTimes*7;
		} else {
			first = 2; 
		} return 2*sevenTimes + first;
	}
}
