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() {
  int n, m, t, l, r;
  cin >> n;
  if (n < 2) {
    l = 0;
    r = 1;
  } else if (n <= 5) {
    l = 0;
    r = 2;
  } else if (n <= 7) {
    l = n - 5;
    r = 2;
  } else if (n > 7) {
    m = n / 7;
    m *= 2;
    t = n % 7;
    if (t < 2) {
      l = m;
      r = m + t;
    } else if (t <= 5) {
      l = m;
      r = m + 2;
    } else if (t < 7) {
      l = m + t - 5;
      r = m + 2;
    }
  }
  cout << l << " " << r;
  return 0;
}
