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.
#include <bits/stdc++.h>
using namespace std;
struct TT {
  int a, b, dir;
};
TT tt[1];
long long ff[11], n, m, i, j, k, l, t, s, r, mmax, mmin, num, ans;
long long MOD = 1e9 + 7;
int main() {
  scanf("%I64d", &n);
  r = n / 7 * 2;
  t = n % 7;
  if (t > 5)
    t -= 5;
  else
    t = 0;
  r += t;
  s = n / 7 * 2;
  t = n % 7;
  if (t > 2) t = 2;
  s += t;
  printf("%I64d %I64d\n", r, s);
  return 0;
}
