#include <bits/stdc++.h>

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")

//#define D_GLIBCXX_DEBUG
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pii pair<int, int>

typedef long long ll;
typedef long double ld;

#define int long long

using namespace std;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const int mod = 998244353;
const int inf = 1e9 + 9;

vector<vector<int>> g;
vector<int>  c, sz;
int ans = 1;
int pw(int a, int p) {
    if (p == 0) return 1;
    if (p % 2) return (a * pw(a, p - 1)) % mod;
    int x = pw(a, p / 2);
    return (x * x) % mod;
}
void dfs(int v, int cr = 0, int p = -1){
    if (c[v]) cr++;
    else ans *= (cr + 1), ans %= mod;

    sz[v] = 1;
    for (auto to: g[v]) {
        if (to == p) continue;
        dfs(to, cr, v);
        sz[v] += sz[to];
    }
    if (!c[v]) return;
    for (int to: g[v]) {
        if (to == p) continue;
        ans += ((pw(2, sz[to]) - 1) * (pw(2, sz[v] - sz[to] - 1) - 1)) % mod;
        ans %= mod;
        sz[v] -= sz[to];
    }

}
void solve() {
    cout << -1 << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#ifdef Local
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // Local
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}