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

const int nmax=1e6+42;

int n;

char inp[nmax];

vector<int> seen[3];

bool zero=0;

void solve(int l,int r)
{
    while(l<r&&inp[l]=='0')l++;

    //cout<<"solve "<<l<<" "<<r<<endl;

    int sum=0;
    for(int i=l;i<=r;i++)
        sum=sum+inp[i]-'0';

    if(sum%3==0)
    {
        for(int i=l;i<=r;i++)
            printf("%c",inp[i]);

        printf("\n");
        return;
    }

    if(r-l+1==1)
    {
        if(zero)printf("0\n");
        else printf("-1\n");
        return;
    }

    seen[0]={};
    seen[1]={};
    seen[2]={};

    for(int i=l;i<=r;i++)
        if(i==l)
        {
            if(inp[i+1]!='0')seen[(inp[i]-'0')%3].push_back(i);
        }
        else seen[(inp[i]-'0')%3].push_back(i);

    //cout<<seen[0].size()<<" "<<seen[1].size()<<" "<<seen[2].size()<<endl;

    if(seen[sum%3].size())
    {
        int ignore=seen[sum%3].back();

        for(int i=l;i<=r;i++)
            if(i!=ignore)printf("%c",inp[i]);

        printf("\n");
        return;
    }

    if(seen[3-sum%3].size()>=2&&r-l+1>=3)
    {
        int SZ=seen[3-sum%3].size();

        int u=seen[3-sum%3][SZ-2];
        int v=seen[3-sum%3][SZ-1];

        //cout<<"u= "<<u<<" v= "<<v<<endl;

        for(int i=l;i<=r;i++)
            if(i!=u&&i!=v)printf("%c",inp[i]);

        printf("\n");
        return;
    }

    solve(l+1,r);
}
void solve()
{
    scanf("%s",&inp);

    n=0;
    while('0'<=inp[n]&&inp[n]<='9')n++;

    zero=0;
    for(int i=0;i<n;i++)
        if(inp[i]=='0')zero=1;

    //cout<<"n= "<<n<<endl;

    solve(0,n-1);
}

int main()
{

    freopen("three.in","r",stdin);
    freopen("three.out","w",stdout);

    int t;

    scanf("%i",&t);
    while(t)
    {
        t--;
        solve();
    }

    return 0;
}