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 a;
  cin >> a;
  long long int h = a;
  long long int min = 0, max = 0;
  long long int i = 0;
  bool k = true;
  long long int g = 0;
  while (h != 0) {
    if (h == 0) break;
    if (i >= 0 && k) {
      i++;
      h--;
    }
    if (h == 0) break;
    if (i == 5) {
      i = 0;
      k = false;
    }
    if (h == 0) break;
    if ((!k) && g >= 0) {
      min++;
      g++;
      h--;
    }
    if (h == 0) break;
    if (g == 2) {
      g = 0;
      k = true;
    }
    if (h == 0) break;
  }
  cout << min;
  i = 0;
  g = 0;
  k = true;
  while (a != 0) {
    if (a == 0) break;
    if (i >= 0 && k) {
      max++;
      i++;
      a--;
    }
    if (a == 0) break;
    if (i == 2) {
      i = 0;
      k = false;
    }
    if (a == 0) break;
    if ((!k) && g >= 0) {
      g++;
      a--;
    }
    if (a == 0) break;
    if (g == 5) {
      g = 0;
      k = true;
    }
    if (a == 0) break;
  }
  cout << " " << max;
}
