/*Sherlock and Watson and Adler*/
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<complex>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-10
using namespace std;
const int N = 100005;
const int M = 40;
const int inf = 100000000;
const int mod = 2009;
int k1,k2,p;
__int64 ans[N];
void dfs(__int64 sum,int c1,int c2)
{
    if(c1>=k1&&c2>=k2)
    {
        ans[p++]=sum;
        return ;
    }
    if(c1<k1)//4
        dfs(sum*10+4,c1+1,c2);
    if(c2<k2)//7
        dfs(sum*10+7,c1,c2+1);
}
int main()
{
    int i,t,q;
    __int64 n;
    p=0;
     for(i=2;i<=18;i+=2)
     {
         k1=k2=i/2;
         dfs(0,0,0);
     }   //printf("p=%d\n",p);
     /*for(i=0;i<p;i++)
         printf("%I64d ",ans[i]);*/
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        q=lower_bound(ans,ans+p,n)-ans;
        //printf("q=%d\n",q);
        if(q<p)
            printf("%I64d\n",ans[q]);
        else
            puts("44444444447777777777");
    }
    return 0;
}