1
// Problem: CF 2233 A
2
// Contest: Codeforces - Educational Codeforces Round 191 (Rated for Div. 2)
3
// URL: https://codeforces.com/contest/2233/problem/A
4
// Time: 2026-06-10 00:48:25
5
#include <bits/stdc++.h>
6
using namespace std;
7

8
// clang-format off
9
#define endl '\n'
10
#define all(x) (x).begin(), (x).end()
11
#define fastio() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
12
// clang-format on
13

14
using ll = long long;
15
using ull = unsigned long long;
16
using pii = pair<int, int>;
17
using pdd = pair<double, double>;
18
using pll = pair<long long, long long>;
19
using i128 = __int128;
20

21
const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
22
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
23
const int inf = 0x3f3f3f3f;
24
const int N = 0;
25

26
void solve()
27
{
28
    double n, x, y, z;
29
    cin >> n >> x >> y >> z;
30

31
    int res1 = ceil(n / (x + y));
32
    int res2 = ceil(n / x);
33
    int res3 = z + ceil((n - x * z) / (x + 10 * y));
34

35
    cout << min({res1, res2, res3}) << endl;
36
}
37

38
int main()
39
{
40
    fastio();
41

42
    int T = 1;
43
    cin >> T;
44

45
    while (T--)
46
        solve();
47

48
    return 0;
49
}

1
// Problem: CF 2233 B
2
// Contest: Codeforces - Educational Codeforces Round 191 (Rated for Div. 2)
3
// URL: https://codeforces.com/contest/2233/problem/B
4
// Time: 2026-06-10 00:57:04
5
#include <bits/stdc++.h>
6
using namespace std;
7

8
// clang-format off
9
#define endl '\n'
10
#define all(x) (x).begin(), (x).end()
11
#define fastio() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
12
// clang-format on
13

14
using ll = long long;
15
using ull = unsigned long long;
16
using pii = pair<int, int>;
17
using pdd = pair<double, double>;
18
using pll = pair<long long, long long>;
19
using i128 = __int128;
20

21
const int dx[] = {-1, 0, 1, 0, -1, 1, 1, -1};
22
const int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
23
const int inf = 0x3f3f3f3f;
24
const int N = 0;
25

26
void solve()
27
{
28
    int n;
29
    cin >> n;
30

31
    vector<int> a(n);
32
    iota(all(a), 1);
33

34
    for (int i = 1; i <= 4; i++)
35
    {
36
        for (auto x: a)
37
            cout << x << " ";
38
        rotate(a.begin(), a.begin() + (i % n), a.end());
39
    }
40
    cout << endl;
41
}
42

43
int main()
44
{
45
    fastio();
46

47
    int T = 1;
48
    cin >> T;
49

50
    while (T--)
51
        solve();
52

53
    return 0;
54
}