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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		int n;
		while (in.nextToken() != StreamTokenizer.TT_EOF) {
			n = (int) in.nval;
			int a = n % 7;
			int b = n / 7;
			int max = 0, min = 0;
			switch (a) {
			case 0:
				max = b * 2;
				min = b * 2;
				break;
			case 1:
				max = b * 2 + 1;
				min = b * 2;
				break;
			case 2:
				max = b * 2 + 2;
				min = b * 2;
				break;
			case 3:
				max = b * 2 + 2;
				min = b * 2;
				break;
			case 4:
				max = b * 2 + 2;
				min = b * 2;
				break;
			case 5:
				max = b * 2 + 2;
				min = b * 2;
				break;
			case 6:
				max = b * 2 + 2;
				min = b * 2 + 1;
				break;
			}
			System.out.println(min + " " + max);
		}

	}
}
		  	   		 	    	    		 		 	 	