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 re
# re.split(r'[;,\s]\s*', line)
n=int(input())
if n>=8:
    ans1=((n-5)//7)*2 + min(2, (n-5)%7)       
    ans2=((n-2)//7)*2 + 2 + max(0, (n-2)%7-5) 
elif n<=2:
    ans1=0
    ans2=n
elif n<=5:
    ans1=0
    ans2=2
elif n==6 :
    ans1=1
    ans2=2
elif n==7:
    ans1=2
    ans2=2
print("%d %d"%(ans1, ans2))
       		   	 			 	  				    		