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>
const long long max9 = 10 + 1e9, max6 = 10 + 1e6, max12 = 10 + 1e12,
                max15 = 10 + 1e15;
const long long min6 = -1 * max6, min9 = -1 * max9, min12 = -1 * max12,
                min15 = -1 * max15;
const long long R = 7 + 1e9, NN = 10 + 1e5;
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    int n;
    cin >> n;
    if (n % 7 == 0) {
      n /= 7;
      cout << 2 * n << " " << 2 * n;
    } else {
      if (n % 7 == 1) {
        n /= 7;
        cout << 2 * n << " " << 2 * n + 1;
      } else {
        if (n % 7 == 2) {
          n /= 7;
          cout << 2 * n << " " << 2 * n + 2;
        } else {
          if (n % 7 == 6) {
            n /= 7;
            cout << 2 * n + 1 << " " << 2 * n + 2;
          } else {
            n /= 7;
            cout << 2 * n << " " << 2 * n + 2;
          }
        }
      }
    }
  }
  return 0;
}
