Removed some empty problems and solved 2 problems in rust

18 files changed, 0 insertions, 874 deletions

diff --git a/contests/EduRound145/A/main.cpp b/contests/EduRound145/A/main.cpp
deleted file mode 100755
index 171d87c..0000000
--- a/contests/EduRound145/A/main.cpp
+++ /dev/null
@@ -1,152 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-void solve() {
-  string s;
-  cin >> s;
-  set<char> st;
-  map<char, int> mp;
-  for (auto ch : s) {
-    st.insert(ch);
-    mp[ch]++;
-  }
-  for (auto ch : st) {
-    if (mp[ch] == 3) {
-      cout << 6 << '\n';
-      return;
-    } else if (mp[ch] == 4) {
-      cout << -1 << '\n';
-      return;
-    }
-  }
-  cout << 4 << '\n';
-
-  
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/EduRound145/A/main_input0.txt b/contests/EduRound145/A/main_input0.txt
deleted file mode 100644
index 4fa6caf..0000000
--- a/contests/EduRound145/A/main_input0.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-3
-9546
-0000
-3313
diff --git a/contests/EduRound145/A/main_output0.txt b/contests/EduRound145/A/main_output0.txt
deleted file mode 100644
index 5aa0822..0000000
--- a/contests/EduRound145/A/main_output0.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-4
--1
-6
diff --git a/contests/EduRound145/B/main.cpp b/contests/EduRound145/B/main.cpp
deleted file mode 100755
index f95b893..0000000
--- a/contests/EduRound145/B/main.cpp
+++ /dev/null
@@ -1,150 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-ll mySqrt(ll a) {
-  ll l = 0, r = 1e9 + 1;
-  while (l + 1 < r) {
-    ll m = (l + r) / 2;
-    if (m * m <= a) {
-      l = m;
-    } else {
-      r = m;
-    }
-  }
-  return l;
-}
-
-void solve() {
-  ll n;
-  cin >> n;
-  cout << (ll)sqrt(n - 1) << '\n';
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/EduRound145/B/main_input0.txt b/contests/EduRound145/B/main_input0.txt
deleted file mode 100644
index e383f1f..0000000
--- a/contests/EduRound145/B/main_input0.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-4
-1
-3
-5
-975461057789971042
diff --git a/contests/EduRound145/B/main_input1.txt b/contests/EduRound145/B/main_input1.txt
deleted file mode 100644
index 42a2f8b..0000000
--- a/contests/EduRound145/B/main_input1.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-1
-6
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input2.txt b/contests/EduRound145/B/main_input2.txt
deleted file mode 100644
index 051f23d..0000000
--- a/contests/EduRound145/B/main_input2.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-3
-2
-4
-16
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input3.txt b/contests/EduRound145/B/main_input3.txt
deleted file mode 100644
index ee95794..0000000
--- a/contests/EduRound145/B/main_input3.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-5
-9
-10
-12
-15
-16
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_input4.txt b/contests/EduRound145/B/main_input4.txt
deleted file mode 100644
index ccb572c..0000000
--- a/contests/EduRound145/B/main_input4.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-1
-1000000000000000000
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output0.txt b/contests/EduRound145/B/main_output0.txt
deleted file mode 100644
index 00eb37d..0000000
--- a/contests/EduRound145/B/main_output0.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-0
-1
-2
-987654321
diff --git a/contests/EduRound145/B/main_output1.txt b/contests/EduRound145/B/main_output1.txt
deleted file mode 100644
index d8263ee..0000000
--- a/contests/EduRound145/B/main_output1.txt
+++ /dev/null
@@ -1 +0,0 @@
-2
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output2.txt b/contests/EduRound145/B/main_output2.txt
deleted file mode 100644
index da8092b..0000000
--- a/contests/EduRound145/B/main_output2.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-1
-2
-4
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output3.txt b/contests/EduRound145/B/main_output3.txt
deleted file mode 100644
index d78555d..0000000
--- a/contests/EduRound145/B/main_output3.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-3
-3
-3
-3
-4
\ No newline at end of file
diff --git a/contests/EduRound145/B/main_output4.txt b/contests/EduRound145/B/main_output4.txt
deleted file mode 100644
index 21ce28a..0000000
--- a/contests/EduRound145/B/main_output4.txt
+++ /dev/null
@@ -1 +0,0 @@
-1000000000
\ No newline at end of file
diff --git a/contests/EduRound145/C/main.cpp b/contests/EduRound145/C/main.cpp
deleted file mode 100755
index 8cfbed2..0000000
--- a/contests/EduRound145/C/main.cpp
+++ /dev/null
@@ -1,136 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-void solve() {
-  int n, k;
-  cin >> n >> k;
-  vi a = {1, 2, -3, 4, 5};
-
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/EduRound145/D/main.cpp b/contests/EduRound145/D/main.cpp
deleted file mode 100755
index 70c7757..0000000
--- a/contests/EduRound145/D/main.cpp
+++ /dev/null
@@ -1,132 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-void solve() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/EduRound145/E/main.cpp b/contests/EduRound145/E/main.cpp
deleted file mode 100755
index 70c7757..0000000
--- a/contests/EduRound145/E/main.cpp
+++ /dev/null
@@ -1,132 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-void solve() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-
diff --git a/contests/EduRound145/F/main.cpp b/contests/EduRound145/F/main.cpp
deleted file mode 100755
index 70c7757..0000000
--- a/contests/EduRound145/F/main.cpp
+++ /dev/null
@@ -1,132 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-using pii = pair<int, int>;
-using vpi = vector<pii>;
-using vi = vector<int>;
-using vll = vector<long long>;
-using mpii = map<int, int>;
-using mpll = map<ll, ll>;
-using db = long double;
-
-#define pb push_back 
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define lb lower_bound
-#define ub upper_bound
-#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
-#define ceil(a, b) ((a) + (b) - 1) / (b))
-
-const int MOD = (int)1e9 + 7;
-const db PI = acos((db)-1);
-const int dx[4]{1, 0, -1, 0};
-const int dy[4]{0, 1, 0, -1};
-
-template<typename K, typename V> ostream& operator<<(ostream& os, const pair<K, V>& p);
-template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec);
-template<typename K, typename V> ostream& operator<<(ostream& os, const map<K, V>& m);
-template<typename K, typename V> ostream& operator<<(ostream& os, const unordered_map<K, V>& m);
-template<typename T> ostream& operator<<(ostream& os, const set<T>& s);
-template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s);
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const pair<K, V>& p) {
-  os << "(" << p.first << ", " << p.second << ")";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const vector<T>& vec) {
-  os << "{";
-  for (size_t i = 0; i < vec.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << vec[i];
-  }
-  os << "}";
-  return os;
-}
-
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename K, typename V>
-ostream& operator<<(ostream& os, const unordered_map<K, V>& m) {
-  os << "{";
-  for (const auto& p : m) {
-    os << p.first << ": " << p.second << ", ";
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-template<typename T>
-ostream& operator<<(ostream& os, const unordered_set<T>& s) {
-  int i = 0;
-  os << "{";
-  for (const auto& e : s) {
-    if (i > 0) os << ", ";
-    os << e;
-    i++;
-  }
-  os << "}";
-  return os;
-}
-
-void print() {
-  cerr << "\n";
-}
-
-template<typename T, typename... TS>
-void print(T val, TS... vals) {
-  cerr << val << " ";
-  print(vals...);
-}
-
-
-
-/* stuff you should look for:
-  ---------------------------
-   * special cases (n=1?)
-   * int overflow, array bounds
-   * do smth instead of nothing and stay organized
-   * WRITE STUFF DOWN
-   * DON'T GET STUCK ON ONE APPROACH
- */
-
-void solve() {
-
-}
-
-int main () {
-  ios_base::sync_with_stdio(false);
-  cin.tie(NULL);
-  int tt;
-  cin >> tt;
-  while(tt--) {
-    solve();
-  }
-}
-
-