/*** https://mindcoding.ro/pb/maxrev ***/

#include <iostream>
#include <math.h>

using namespace std;

unsigned long long int computeReversedNumber(unsigned long long int n) {
	int nrDigits = 0;
	int* digits = new int[32];

	while (n > 0) {
		digits[nrDigits] = n % 10;
		nrDigits++;
		n = n / 10;
	}

	unsigned long long int reversedNumber = 0;
	for (int i = 0; i < nrDigits; i++) {
		reversedNumber += digits[i] * (int)pow(10, nrDigits - 1 - i);
	}

	return reversedNumber;
}

int main()
{
	int N;
	cin >> N;

	unsigned long long int* numbers = new unsigned long long int[N];
	for (int i = 0; i < N; i++) {
		cin >> numbers[i];
	}

	for (int i = N - 1; i >= 0; i--) {
		cout << computeReversedNumber(numbers[i]) << endl;
	}

	return 0;
}