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 sys


#
# inf = float("inf")
# # sys.setrecursionlimit(10000000)
# # abc='abcdefghijklmnopqrstuvwxyz'
# # abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
# # words = {1:'one',2:'two',3:'three',4:'four',5:'five',6:'six',7:'seven',8:'eight',9:'nine',10:'ten',11:'eleven',12:'twelve',13:'thirteen',14:'fourteen',15:'quarter',16:'sixteen',17:'seventeen',18:'eighteen',19:'nineteen',20:'twenty',21:'twenty one',22:'twenty two',23:'twenty three',24:'twenty four',25:'twenty five',26:'twenty six',27:'twenty seven',28:'twenty eight',29:'twenty nine',30:'half'}
# # vow=['a','e','i','o','u']
# # dx,dy=[0,1,0,-1],[1,0,-1,0]
#
# # import random
# from collections import deque, Counter, OrderedDict,defaultdict
# # from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
# # from math import ceil,floor,log,sqrt,factorial,pi,gcd,degrees,atan2
# # from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
# mod, MOD = 1000000007, 998244353
#
#
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))


def get_ints(): return map(int, sys.stdin.readline().strip().split())


def input(): return sys.stdin.readline().strip()


n = int(input())
max = min = (n // 7) * 2
if n % 7 != 0:
	t = n % 7
	if (t < 2):
		max += 1
	else:
		max += 2
if (n % 7 == 6):
	min += 1
print(min, max)
