#include <stdio.h> // 快速幂取模函数 //B站大佬有专门教汉诺塔模型的 long long hannuota(long long b, long long e, long long m) { long long r = 1; while (e > 0) { if (e % 2 == 1) { r = (r * b) % m; } b = (b * b) % m; e /= 2; } return r; }

int main() { int N; scanf("%d", &N); while (N--) { int m; scanf("%d", &m); // 计算2^m - 1的最后六位，并输出 long long steps = (hannuota(2, m, 1000000) - 1 ) % 1000000; printf("%lld\n", steps); } return 0; }