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.

def a657():
    a,b,c=map(int,input().split())
    if ( c>=0 and b<a ) or ( c<=0 and b>a ):
        print("NO")
        return 0
    if a==b or (b-a)%c == 0 :
        print("YES")
    else:
        print("NO")

def a670():
    a=int(input())
    n=int(a/7)*2
    if 1 < a%7 < 6:
        print(n,n+2)
    elif a%7==6:
        print(n+1,n+2)
    elif a%7==1:
        print(n,n+1)
    else:
        print(n,n)

a670()		
