[NHSPC 2019] B. 完全平方二項係數

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
    fastIO();

    int t;
    cin >> t;
    while (t--) {
        uint64_t n;
        cin >> n;

        int ansX = 1, ansY = 0, baseX = 3, baseY = 2, tmpX, tmpY;
        while (n) {
            if (n & 1) {
                tmpX = ansX * baseX + 2 * ansY * baseY;
                tmpY = ansX * baseY + ansY * baseX;
                ansX = tmpX % mod, ansY = tmpY % mod;
            }
            tmpX = baseX * baseX + 2 * baseY * baseY;
            tmpY = 2 * baseX * baseY;
            baseX = tmpX % mod, baseY = tmpY % mod;
            n >>= 1;
        }

        cout << (ansX+1) * (int)(5E8 + 4) % mod << " ";
        cout << ansY * (int)(5E8 + 4) % mod << "\n";
    }

    return 0;
}