#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <map>
#include <utility>
#include <fstream>
#include <bitset>
#include <deque>
typedef long long int ll;
#define all(x) (x).begin(),(x).end()
#define endl "\n";
long double pi = 3.14159265358979;
using namespace std;
int inf = 1e12;
ll MOD = 998244353;
void fastIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
vector <vector <int>> gr;
vector <int> dist(int v, int n) {
    vector <int> d(n, -1);
    d[v] = 0;
    deque<int> q;
    q.push_back(v);
    while (!q.empty()) {
        int u = q.front();
        q.pop_front();
        for (int l : gr[u])
            if (d[l] == -1) {
                d[l] = d[u] + 1;
                q.push_back(l);
            }
    }
    return d;
}

int lmao(vector <int>& a, int d) {
    for (int i = 0; i < a.size(); i++)
        if (a[i] == d)
            return i;
}

void solve() {
    string t;
    cin >> t;
    string s = "";
    bool f = true;
    for (int i = 1; i < t.size(); i++)
        if (t[i] != t[i - 1])
            f = false;
    if (f) cout << t << "\n";
    else {
        for (int i = 0; i < t.size(); i++)
            s += "10";
        cout << s << "\n";
    }
}

int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) solve();

}
/*---------------------------------------------------------*/
//task 2.1
void solve() {

}

//task 2.2
void solve(ll n) {
    vector <ll> a(n+1);
    a[0] = 1;
    a[1] = 1;
    for (int i = 2; i <= n; i++)
        for (int j = 0; j < i; j++)
            a[i] += a[j] * a[i - j - 1];
    cout << a[n];

}
//task 2.3

void solve(ll n1, ll n2, ll x1, ll x2) {
    set <ll> s1;
    set <ll> s2;
    for (int k = 0; x1 + k * n1 < n1 * n2; k++)
        s1.insert(x1 + k * n1);
    for (int k = 0; x2 + k * n2 < n1 * n2; k++)
        s1.insert(x2 + k * n2);
    while (s1.size() > 0) {
        ll p = *s1.begin();
        s1.erase(p);
        if (s2.find(p) != s2.end()) {
            cout << p;
            return;
        }
    }
}

//task 2.4
void solve(string data) {
    cout << fixed;
    cout.precision(10);
    ll d = 31536000;

    ll cur = 1e9; // текущение количество секунд
    cout << 1.0L * cur / d * 100;

}

// task 2.5
void solve(vector <vector <int>> gr, int n, int m) {
    vector <int> d(n);
    dfs(0, gr, d);
    for (int i = 0; i < n; i++)
        if (d[i] == 1) {
            cout << "yeap\n";
            return;
        }
    cout << "nope\n";
}
void dfs(int v, vector <vector <int>> &gr, vector <int> &d) {
    for (int u : gr[v])
        dfs(u, gr, d);
    if (gr[v].size() == 0)
        d[v] = 0;
    else {
        d[v] = 0;
        for (int u : gr[v])
            if (d[u] == 0) {
                d[v] = 1;
                break;
            }
    }
}