670A - Holidays

670A - Holidays

1. 
   A. Holidays

    

   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

   Copy

   14
   

   output

   Copy

   4 4
   

   input

   Copy

   2
   

   output

   Copy

   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.

2. 
   
3. 
   
4. 
   
5. #include<iostream>
6. using namespace std;
7. int main()
8. {
9. long n;
10. cin>>n;
11. long d=0,x=0;int i=1;
12. long m=n;
13. ///max
14. d=n/7;
15. x= n- 7*d;
16. if(x>=2 and x!=0) x=2;
17. else if(x<2 and x!=0) x=1;
18.  
19. ///min
20. int mn=0;
21.  
22. while(m--){
23. n=n-5;
24. if(n>=2 and n!=0){ mn+=2; n=n-2;}
25. else if(n>=1 and n!=0 ){ mn+=1; n=n-1;}
26. //cout<<n<<" ";
27. }
28. cout<<mn<<" ";
29. cout<<2*d+x;
30.  
31. return 0;
32. }