codeforces 670A Holidays

最新推荐文章于 2022-03-23 19:57:57 发布

原创最新推荐文章于 2022-03-23 19:57:57 发布 · 252 阅读

0 ·

CC 4.0 BY-SA版权

Acm 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个算法，用于计算火星年中可能的最小和最大休息天数，考虑到火星年为n天，且遵循5个工作日加2天休息的原则。通过输入一年的总天数n（1≤n≤1,000,000），输出每年可能的最少和最多休息日数量。

A. Holidays

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Output

4 4

Input

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 <iostream>
#include <cstring>
using namespace std;
int main(){
    int n,l,r;
    cin>>n;
    l=r=n/7*2;
    int mod=n%7;
    if(mod==1) r+=1;
    else if(mod>=2&&mod<=5) r+=2;
    else if(mod==6) l+=1,r+=2;
    cout<<l<<' '<<r<<endl;
    return 0;
}