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 Mahen {
	public static void main(String[] args) {
		Scanner sc = null;
		try {
			sc = new Scanner(System.in);
			//System.out.println("Enter the number of days per year: ");
			int days = sc.nextInt();
			if (days < 1 || days > 1000000) {
				System.out.println("Invalid number");
			} else {
				int min = getMinHolidays(days);
				int max = getMaxHolidays(days);
				System.out.println(min + " " + max);
			}
		} catch (Exception e) {
			System.out.println("Invalid input");
		} finally {
			sc.close();
		}
	}

	private static int getMinHolidays(int n) {
		int x = (n / 7) * 2;
		int y = n % 7;
		if (y == 6) {
			x++;
		}
		return x;
	}

	private static int getMaxHolidays(int n) {
		int x = (n / 7) * 2;
		int y = n % 7;
		if (y == 1) {
			x++;
		} else if (y > 1) {
			x = x + 2;
		}
		return x;
	}
}