Non-alternating Deck (easy version)

题意翻译

Alice 有 $n$ 张牌，所有牌的颜色均一样。 Alice 准备把牌分给 Bob 和她自己。Alice 以这样的方式发牌：一张牌给 Alice，两张牌给 Bob，三张牌给 Bob，四张牌给 Alice，五张牌给 Alice，六张牌给 Bob，以此类推。当某一步没有足够的牌时，Alice 会将所有剩余的牌发给当前玩家，且停止发牌。 给出牌的张数 $n$，求每个玩家最后的牌数。 有多组数据。

题目描述

This is an easy version of the problem. In this version, all cards have the same color. Alice has $ n $ cards, each card is white, and the cards are stacked in a deck. Alice deals the cards to herself and to Bob, dealing at once several cards from the top of the deck in the following order: one card to herself, two cards to Bob, three cards to Bob, four cards to herself, five cards to herself, six cards to Bob, seven cards to Bob, eight cards to herself, and so on. In other words, on the $ i $ -th step, Alice deals $ i $ top cards from the deck to one of the players; on the first step, she deals the cards to herself and then alternates the players every two steps. When there aren't enough cards at some step, Alice deals all the remaining cards to the current player, and the process stops.  First Alice's steps in a deck of many cards.How many cards will Alice and Bob have at the end?

输入输出格式

输入格式

Each test contains multiple test cases. The first line contains the number of test cases $ t $ ( $ 1 \le t \le 200 $ ). The description of the test cases follows The only line of each test case contains a single integer $ n $ ( $ 1 \le n \le 10^6 $ ) — the number of cards.

输出格式

For each test case print two integers — the number of cards in the end for each player — in this order: cards Alice has, cards Bob has.

输入输出样例

输入样例 #1

5
10
6
17
8
1000000

输出样例 #1

5 5
1 5
10 7
3 5
500202 499798