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.*;
public class Holidays {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int numDaysOff=0;
		int numDays=0;
		int sum = 0;
		for(int i = 1; i <= n; i++) {
			if(i%2 == 0) {
				if(2+sum <= n) {
					numDaysOff += 2;
					sum+=2;
				}else {
					numDaysOff += n-sum;
					sum += n-sum;
				}
			}else {
				if(5+sum <= n) {
					numDays += 5;
					sum += 5;
				}else {
					numDays += n-sum;
					sum += numDays;
				}
			}
			if(sum >= n) {
				break;
			}
		}
		System.out.print(numDaysOff + " ");
		numDaysOff =0;
		numDays = 0;
		sum = 0;
		for(int i = 1; i <= n; i++) {
			if(i%2 != 0) {
				if(2+sum <= n) {
					numDaysOff += 2;
					sum+=2;
				}else {
					numDaysOff += n-sum;
					sum += n-sum;
				}
			}else {
				if(5+sum <= n) {
					numDays += 5;
					sum += 5;
				}else {
					numDays += n-sum;
					sum += numDays;
				}
			}
			if(sum >= n) {
				break;
			}
		}
		System.out.println(numDaysOff);
	}

}
