fork download
  1. /**
  2.  * author: orzvanh14 ( )
  3.  * created: 23.12.2022 10:08:02
  4.  * too lazy to update time
  5. **/
  6. // i wants to take ioi
  7. //binhtinhtutinkhongcaycunhungmotkhikhongcontutinnualatuyetvong
  8. #include <bits/stdc++.h>
  9.  
  10. using namespace std;
  11.  
  12. #define int long long
  13. #define nn "\n"
  14. #define pi pair<int, int>
  15. #define fi first
  16. #define se second
  17. #define lb lower_bound
  18. #define ub upper_bound
  19. #define eb emplace_back
  20. #define pb push_back
  21. #define TASK " "
  22.  
  23. #define ms(a, x) memset(a, x, sizeof(a))
  24. #define all(a) a.begin(), a.end()
  25. #define All(a, n) a + 1, a + 1 + n
  26.  
  27. #define LOG 19
  28.  
  29.  
  30. const int INF = 1e18;
  31. const int mod = 1e9+7;
  32. const int N = 2e5 + 5;
  33. int MOD = 998244353;
  34. int bit[200000];
  35. struct node{
  36. int kc, u, hk;
  37. bool operator<(const node& other) const {
  38. return kc > other.kc;
  39. }
  40. };
  41. struct edge{
  42. int v, w, h;
  43. };
  44. int n;
  45. int mn, mx;
  46. void nhap(){
  47. cin >> n;
  48. }
  49. void solve(){
  50. int d = n % 6;
  51. int tmp = n / 6;
  52. mn = tmp + 7 - d;
  53. mx = n * 6;
  54. cout << mn << " " << mx << nn;
  55. }
  56. signed main() {
  57. // freopen("piggyback.in", "r", stdin);
  58. // freopen("piggyback.out", "w", stdout);
  59. ios_base::sync_with_stdio(0);
  60. cin.tie(0);
  61. cout.tie(0);
  62. nhap();
  63. solve();
  64. return (0 ^ 0);
  65.  
  66. }
Success #stdin #stdout 0s 5320KB
stdin
2
stdout
5 12