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;
  while (scanf("%d", &n) != EOF) {
    int temp = n, max = 0, min = 0;
    bool flag = true;
    for (;;) {
      if (flag) {
        if (temp > 2) {
          temp = temp - 2;
          max = max + 2;
          flag = false;
        } else {
          max = max + temp;
          flag = false;
          break;
        }
      } else if (!flag) {
        if (temp > 5) {
          temp = temp - 5;
          flag = true;
        } else {
          flag = true;
          break;
        }
      }
    }
    temp = n;
    flag = true;
    for (;;) {
      if (flag) {
        if (temp > 5) {
          temp = temp - 5;
          flag = false;
        } else {
          break;
        }
      } else {
        if (temp > 2) {
          temp = temp - 2;
          min = min + 2;
          flag = true;
        } else {
          min = min + temp;
          break;
        }
      }
    }
    cout << min << " " << max << endl;
  }
  return 0;
}
