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;
int main() {
  long long int n, mx, mn, i, j, a, s, d;
  scanf("%lld", &n);
  if (n == 1) {
    printf("0 1\n");
    return 0;
  }
  if (n <= 7) {
    mx = 2;
    if (n <= 5) {
      mn = 0;
    } else {
      mn = n - 5;
    }
  } else {
    i = n / 7;
    mx = i * 2;
    mn = mx;
    n = n - (i * 7);
    if (n % 7 == 0) {
      mn = mx;
    } else {
      if (n > 0) {
        if (n > 1) {
          mx += 2;
        } else {
          mx += 1;
        }
      }
      if (n <= 5) {
        mn += 0;
      } else {
        mn += (n - 5);
      }
    }
  }
  printf("%lld %lld\n", mn, mx);
  return 0;
}
