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 n;
  cin >> n;
  long d = 0, x = 0;
  int i = 1;
  long m = n;
  d = n / 7;
  x = n - 7 * d;
  if (x >= 2 and x != 0)
    x = 2;
  else if (x < 2 and x != 0)
    x = 1;
  int mn = 0;
  while (m--) {
    n = n - 5;
    if (n >= 2 and n != 0) {
      mn += 2;
      n = n - 2;
    } else if (n >= 1 and n != 0) {
      mn += 1;
      n = n - 1;
    }
  }
  cout << mn << " ";
  cout << 2 * d + x;
  return 0;
}
