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

#define modulo 1000000007;
bool compare(int a,int b)
{
    if(a>b)
        return 1;
    return 0;
}

bool isprime(long long n)
{
    for(long long int i=2;i*i<=n;i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}
long long gcd(long long int a, long long int b)
{
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

// Function to return LCM of two numbers
long long lcm(int a, int b)
{
    return (a / gcd(a, b)) * b;
}

vector<int> convert(int b)
{
    vector<int> v;
    while(b!=0)
    {
        v.push_back(b&1);
        b=b>>1;
    }
    return v;
}


void solve()
{
    string s;
    cin>>s;
    int s1=INT_MAX,s0=INT_MIN;
    for(int i=0;i<s.size()-1;i++)
    {
      if(s[i]=='1'&&s[i+1]=='1')
      {
        s1=i;
        break;
      }
    }
    for(int i=s.size()-1;i>-1;i--)
    {
      if(s[i]=='0'&&s[i+1]=='0')
      {
        s0=i+1;
        break;
      }
    }
    if(s0>s1)
      cout<<"NO\n";
    else cout<<"YES\n";

    
return;
}






int main()
{
    int t=1;
    cin>>t;

    while(t--)
    {
       solve(); 
    }

    return 0;
}


