stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
    #include<iostream>

    #include<cstring>

    #include<cstdio>

    #include<cstdlib>

    #include<algorithm>

    #include<map>

    #include<cmath>

    #include<cstdlib>

    using namespace std;

    const int M=105;

char  a[M],b[M];

 int n,m,flag;



int main()

{

    cin>>a;

    cin>>b;

    int i=0;

    flag=0;

    while(b[i]!='\0')

    {

        if(a[i]=='\0')

        {

            flag=1;

            break;

        }

        i++;

    }

    int j=0;

    while(a[j]!='\0')

    {

        if(b[j]=='\0')

        {

            flag=2;

            break;

        }

        j++;

    }

    if(flag==0)

    {

        int k=0;

        while(b[k]!='\0')

        {

            if(a[k]<b[k])

            {

                flag=1;

                break;

            }

            else if(a[k]>b[k])

            {

                flag=2;

                break;

            }

            else if(a[k]==b[k])

            {

                flag=3;

                k++;

            }



        }

    }

    if(flag==1)

        cout<<"LESS"<<endl;

    if(flag==2)

        printf("GREATER");

    if(flag==3)

        printf("EQUAL");



}


// Faster C++ solution for the same problem (measured speedup: 5.0720217127891924x):
#include<stdio.h>

#include<stdlib.h>

int main()

{

    long double A,B;

    scanf("%Lf",&A);

    scanf("%Lf",&B);

    if(A>B)

	{

    printf("GREATER\n"); 

	} 

	if(A<B)

	{

		printf("LESS\n");

	} 

	if (A==B)

	{

		printf("EQUAL\n");

	}

    system("pause");

}
// Slower C++ solution:
    #include<iostream>

    #include<cstring>

    #include<cstdio>

    #include<cstdlib>

    #include<algorithm>

    #include<map>

    #include<cmath>

    #include<cstdlib>

    using namespace std;

    const int M=105;

char  a[M],b[M];

 int n,m,flag;



int main()

{

    cin>>a;

    cin>>b;

    int i=0;

    flag=0;

    while(b[i]!='\0')

    {

        if(a[i]=='\0')

        {

            flag=1;

            break;

        }

        i++;

    }

    int j=0;

    while(a[j]!='\0')

    {

        if(b[j]=='\0')

        {

            flag=2;

            break;

        }

        j++;

    }

    if(flag==0)

    {

        int k=0;

        while(b[k]!='\0')

        {

            if(a[k]<b[k])

            {

                flag=1;

                break;

            }

            else if(a[k]>b[k])

            {

                flag=2;

                break;

            }

            else if(a[k]==b[k])

            {

                flag=3;

                k++;

            }



        }

    }

    if(flag==1)

        cout<<"LESS"<<endl;

    if(flag==2)

        printf("GREATER");

    if(flag==3)

        printf("EQUAL");



}


// Faster C++ solution for the same problem (measured speedup: 5.189529705514179x):
#include<stdio.h>

int main(){

	double a,b;

	scanf("%lf%lf",&a,&b);

	if (a - b != 0){

		if (a - b < 0){

			printf("LESS\n");

			}

			else if(a - b > 0){

				printf("GREATER\n");

				}

		}

		else{

			printf("EQUAL\n");

			}

	return 0;

	}
// Slower C++ solution:
    #include<iostream>

    #include<cstring>

    #include<cstdio>

    #include<cstdlib>

    #include<algorithm>

    #include<map>

    #include<cmath>

    #include<cstdlib>

    using namespace std;

    const int M=105;

char  a[M],b[M];

 int n,m,flag;



int main()

{

    cin>>a;

    cin>>b;

    int i=0;

    flag=0;

    while(b[i]!='\0')

    {

        if(a[i]=='\0')

        {

            flag=1;

            break;

        }

        i++;

    }

    int j=0;

    while(a[j]!='\0')

    {

        if(b[j]=='\0')

        {

            flag=2;

            break;

        }

        j++;

    }

    if(flag==0)

    {

        int k=0;

        while(b[k]!='\0')

        {

            if(a[k]<b[k])

            {

                flag=1;

                break;

            }

            else if(a[k]>b[k])

            {

                flag=2;

                break;

            }

            else if(a[k]==b[k])

            {

                flag=3;

                k++;

            }



        }

    }

    if(flag==1)

        cout<<"LESS"<<endl;

    if(flag==2)

        printf("GREATER");

    if(flag==3)

        printf("EQUAL");



}


// Faster C++ solution for the same problem (measured speedup: 5.294519600703843x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main(){

	long double x,y;

	cin>>x>>y;

	if(x>y)

		cout<<"GREATER";

	else if (x<y)

		cout<<"LESS";

	else

	cout<<"EQUAL";

}

// Faster C++ solution for the same problem (measured speedup: 5.365826734547734x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main(){

	string a;

    string b;

    cin>>a>>b;

	if(a.size()>b.size()){

	cout<<"GREATER";

}

	else if(a==b){

	cout<<"EQUAL";

}

	else if(b.size()>a.size()){

	cout<<"LESS";

}

else if(b.size()==a.size()){

	if(a>b)

	cout<<"GREATER";

	else

	cout<<"LESS";

}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.348985112280089x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

#include <stdio.h>

using namespace std ;

int main(){

long double A,B;

cin>>A;

cin>>B;

if(A>B)

cout<<"GREATER";

else if(A<B)

cout<<"LESS";

else 

cout<<"EQUAL";

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.365711403211017x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include <iostream>

using namespace std;

 

int main() {

	long double A, B;

cin>>A;

cin>>B;

 

if(A==B) {

cout<<"EQUAL";

} else if(A>B) {

cout<<"GREATER" ;

} else if(A<B) {

cout<<"LESS" ;

}

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.360277443448753x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){



long double a,b;

cin>>a>>b;



	if(a>b)

	cout<<"GREATER";

	else if(a==b)

	cout<<"EQUAL";

	else if(a<b)

	cout<<"LESS";







return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.360026545394895x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    long double A, B;

    cin >> A;

    cin >> B;

    if (A==B){

    cout << "EQUAL";



    } else if (A>B){

    cout <<"GREATER";

    }else if (A<B){

    cout << "LESS";

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.360277443448753x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include <iostream>

#include <algorithm>

#include <string> 

using namespace std;



typedef long long ll;



int main()

{

    string a,b;

    cin>>a>>b;

    if(a.size()>b.size())

    {

    	cout<<"GREATER"<<endl;

	}

	else if(a.size()<b.size())

	{

		cout<<"LESS"<<endl;

	}

	else if(a==b)

	{

		cout<<"EQUAL"<<endl;

	}

	else

	{

		for(int i=0;i<a.size();i++)

		{

			if(a[i]>b[i])

			{

				cout<<"GREATER"<<endl;return 0;

			}

			if(a[i]<b[i]){

				cout<<"LESS"<<endl;return 0;

			}

		}

		cout<<"EQUAL"<<endl;

	}

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3597171551363525x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<cstdio>

#include<cstring>

using namespace std;



int main(){

	char a[105];

	char b[105];

	scanf("%s %s",a,b);

	int lena = strlen(a);

	int lenb = strlen(b);

	if(lena > lenb) printf("GREATER\n");

	else if(lena < lenb) printf("LESS\n");

	else{

		for(int i = 0; i < lena; i++){

			if(a[i] == b[i] && i == lena-1){

				printf("EQUAL\n");

				break;

			}

			if(a[i] > b[i]){

				printf("GREATER\n");

				break;

			}

			if(a[i] < b[i]){

				printf("LESS\n");

				break;

			}

		}

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.248901924350731x):
#include<cstdio>

#include<cstring>



using namespace std;



int main(){

	char s[205];

	char s1[205];

	int a[205];

	int b[205];

	int flag = 0;

	scanf("%s%s",s,s1);

	int len = strlen(s);

	int len1 = strlen(s1);

	if(len > len1) printf("GREATER\n");

	else if(len < len1) printf("LESS\n");

	else if(len == len1){

		for(int i = 0; i < len; i++){

			a[i] = s[i] - '0';

			}

		for(int i = 0; i< len1; i++){

			b[i] = s1[i] - '0';

			}

		for(int i =0; i < len; i++){

			if(a[i] > b[i]){

				flag = 1;

				printf("GREATER\n");

				break;

			}			

			else if(a[i] < b[i]){

				flag = 1;

				printf("LESS\n");

				break;

				}

		}

		if(flag == 0) printf("EQUAL\n");

	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long int

#define sz  200010

using namespace std;





string ss[sz];



int main()

{



    string a,b;

    ll x,y;



    cin>>a>>b;

    x=a.length();

    y=b.length();





    if(x>y)

        cout<<"GREATER"<<endl;

    else if(x<y)

        cout<<"LESS"<<endl;

    else

    {





        for(ll i=0; i<x; i++)

        {

            if(a[i]>b[i])

            {

                cout<<"GREATER"<<endl;

                return 0;

            }

            else if(a[i]<b[i])

            {

                cout<<"LESS"<<endl;

                return 0;

            }

        }



        cout<<"EQUAL"<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 8.06362540873709x):
#include<bits/stdc++.h>

using namespace std;

map<int,int>mp;

map<char,int>::iterator it;

  vector<int>v[1000];

int main()

{

string s,s1;

cin>>s>>s1;

int l,l1,c=0,f=0,d,r,m;

l=s.length();

l1=s1.length();

if(l>l1){cout<<"GREATER"<<endl;}

else if(l<l1){cout<<"LESS"<<endl;}

else

{

    for(int i=0;i<l;i++)

    {

      if(s[i]!=s1[i])

      {

          d=s[i]-'0';

          m=s1[i]-'0';

          if(d>m){f=1;}

          else{f=2;}



          break;

      }

    }

    if(f==0){cout<<"EQUAL"<<endl;}

    else if(f==1){cout<<"GREATER"<<endl;}

    else{cout<<"LESS"<<endl;}

}







}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long int

#define sz  200010

using namespace std;





string ss[sz];



int main()

{



    string a,b;

    ll x,y;



    cin>>a>>b;

    x=a.length();

    y=b.length();





    if(x>y)

        cout<<"GREATER"<<endl;

    else if(x<y)

        cout<<"LESS"<<endl;

    else

    {





        for(ll i=0; i<x; i++)

        {

            if(a[i]>b[i])

            {

                cout<<"GREATER"<<endl;

                return 0;

            }

            else if(a[i]<b[i])

            {

                cout<<"LESS"<<endl;

                return 0;

            }

        }



        cout<<"EQUAL"<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 8.208061780494894x):
#include <bits/stdc++.h>



typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);



    //freopen("in.txt","r",stdin);

    //freopen("out.txt","w",stdout);



    string a,b;

    cin >> a >> b;



    if(a.size() > b.size())

    {

        cout << "GREATER" << endl;

    }



    else if(a.size() < b.size())

    {

        cout << "LESS" << endl;

    }



    else

    {

        if(b[0] < a[0])

        {

            cout << "GREATER" << endl;

        }

        else if(a[0] < b[0])

        {

            cout << "LESS" << endl;

        }

        else

        {

            cout << "EQUAL" << endl;

        }

    }

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long int

#define sz  200010

using namespace std;





string ss[sz];



int main()

{



    string a,b;

    ll x,y;



    cin>>a>>b;

    x=a.length();

    y=b.length();





    if(x>y)

        cout<<"GREATER"<<endl;

    else if(x<y)

        cout<<"LESS"<<endl;

    else

    {





        for(ll i=0; i<x; i++)

        {

            if(a[i]>b[i])

            {

                cout<<"GREATER"<<endl;

                return 0;

            }

            else if(a[i]<b[i])

            {

                cout<<"LESS"<<endl;

                return 0;

            }

        }



        cout<<"EQUAL"<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 8.276507168945134x):
#include<bits/stdc++.h>

#define ll long long

#define nl "\n"

#define pi acos(-1)

#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;



int main(){

    string a,b;

    cin>>a;

    cin>>b;

    if(a.size()>b.size()){

        cout<<"GREATER"<<nl;

    }else if(b.size()>a.size()){

        cout<<"LESS"<<nl;

    }else{

    for(int i =0;i<a.size();i++){

        if(a[i]>b[i]){

            cout<<"GREATER"<<nl;

            

            return 0;

        }else if(a[i]<b[i]){

            cout<<"LESS"<<nl;

            return 0;

        }



    }

    cout<<"EQUAL"<<nl;

}

  

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long int

#define sz  200010

using namespace std;





string ss[sz];



int main()

{



    string a,b;

    ll x,y;



    cin>>a>>b;

    x=a.length();

    y=b.length();





    if(x>y)

        cout<<"GREATER"<<endl;

    else if(x<y)

        cout<<"LESS"<<endl;

    else

    {





        for(ll i=0; i<x; i++)

        {

            if(a[i]>b[i])

            {

                cout<<"GREATER"<<endl;

                return 0;

            }

            else if(a[i]<b[i])

            {

                cout<<"LESS"<<endl;

                return 0;

            }

        }



        cout<<"EQUAL"<<endl;

    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 8.223279549455809x):
#include <bits/stdc++.h>

#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

typedef long long ll;

using namespace std;

int main()

{

    Tayeb;

    string A,B;

    cin >> A >> B;



      if(A.length()>B.length())

      cout << "GREATER" << "\n";

      else if(A.length()<B.length())

      cout << "LESS" << "\n";

      else if(A==B)

      cout << "EQUAL" << "\n";

      else

      {

          for(int i=0,j=0; i<A.length()&&j<B.length(); i++,j++)

          {

              if(A[i]!=B[i])

              {

                  if(A[i]>B[i])

                  {

                  cout << "GREATER" << "\n";

                  break;

                  }

                  else if(A[i]<B[i])

                  {

                  cout << "LESS" << "\n";

                  break;

                  }

              }

          }

      }

    return 0;



}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    long double  A,B;

    cin>>A>>B;

    if(A>B)

        cout<<"GREATER";

    else

        if(A<B)

        cout<<"LESS";

    else

    if(A==B)

        cout<<"EQUAL";





}


// Faster C++ solution for the same problem (measured speedup: 5.352818398790058x):
#include<cstdio>

#include<cstring>

using namespace std;

int main()

{

	char a[1000],b[1000];

	scanf("%s %s",&a,&b);

	int la=strlen(a);

	int lb=strlen(b);

	if(la>lb) printf("GREATER\n");

	else if(la<lb) printf("LESS\n");

	else{

		for(int i=0;i<la;i++){

		        if(a[i]>b[i]){

		        	printf("GREATER\n");break;

				}

		        if(a[i]<b[i]){

		        	printf("LESS\n");break;

				}

		        if(a[i]==b[i]){

                   if(i==la-1 && a[i]==b[i])

		        	  printf("EQUAL\n");

		           else continue;

				}

		}

	}

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	long double a,b;

	cin>>a>>b;

	if(a>b)

	{

		cout<<"GREATER";

	}

	else if(a<b)

	{

		cout<<"LESS";

	}

	else

	{

		cout<<"EQUAL";

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.379050748828313x):
#include<cstdio>

#include<cstring>

using namespace std;

int main()

{

	char a[1000],b[1000];

	scanf("%s %s",&a,&b);

	int la=strlen(a);

	int lb=strlen(b);

	if(la>lb) printf("GREATER\n");

	else if(la<lb) printf("LESS\n");

	else{

		for(int i=0;i<la;i++){

		        if(a[i]>b[i]){

		        	printf("GREATER\n");break;

				}

		        if(a[i]<b[i]){

		        	printf("LESS\n");break;

				}

		        if(a[i]==b[i]){

                   if(i==la-1 && a[i]==b[i])

		        	  printf("EQUAL\n");

		           else continue;

				}

		}

	}

}
// Slower C++ solution:
#include <cstdio>

#include <string>

#include <iostream>

using namespace std;

string a, b;

int main()

{

	cin >> a >> b;

	if(a.length() > b.length())

		printf("GREATER\n");

	else if(a.length() < b.length())

		printf("LESS\n");

	else

	{

		if(a > b)		

			printf("GREATER\n");

		if(a < b)

			printf("LESS\n");

		if(a == b)

			printf("EQUAL\n");

	}

	return 0;	

}

// Faster C++ solution for the same problem (measured speedup: 5.310707062594704x):
#include<cstdio>

#include<cstring>

using namespace std;

int main()

{

	char a[1000],b[1000];

	scanf("%s %s",&a,&b);

	int la=strlen(a);

	int lb=strlen(b);

	if(la>lb) printf("GREATER\n");

	else if(la<lb) printf("LESS\n");

	else{

		for(int i=0;i<la;i++){

		        if(a[i]>b[i]){

		        	printf("GREATER\n");break;

				}

		        if(a[i]<b[i]){

		        	printf("LESS\n");break;

				}

		        if(a[i]==b[i]){

                   if(i==la-1 && a[i]==b[i])

		        	  printf("EQUAL\n");

		           else continue;

				}

		}

	}

}
// Slower C++ solution:
#include <iostream> 

#include <string>

using namespace std;



string arr;

char s[100],n=1;

int main(){

	cin>>arr;

	s[0]=arr[0];

	for(int i=1;i<arr.length();i++){

		int fase=1; 

		for(int j=0;j<n;j++){

			if(arr[i]==s[j]){

				fase=0;

			} 

		}

		if(fase){

			s[n]=arr[i];

			n++; 

		}

	}

	if(n==2){

		cout<<"Yes";

	}else{

		cout<<"No";

	}

	return 0; 

} 

// Faster C++ solution for the same problem (measured speedup: 5.310358305432405x):
#include<stdio.h>

#include<string.h>

#include<algorithm>

using namespace std;

char a[5];

int main()

{

	scanf("%s",a);

	int l=strlen(a);

	sort(a,a+4);

	if(a[0]==a[1]&&a[2]==a[3]&&a[0]!=a[2])printf("Yes\n");

	else printf("No\n");

}
// Slower C++ solution:
#include <bits/stdc++.h>

#include <algorithm>

using namespace std;



int main(){

	char arr[4];

	

	cin>>arr;

	

	sort(arr,arr+4);

	

	if(arr[0]!=arr[2] && arr[0]==arr[1] && arr[2]==arr[3]){

		printf("Yes");

	}else{

		printf("No");

	}

	

	

	return 0;

}









































 

// Faster C++ solution for the same problem (measured speedup: 5.299071594869108x):
#include<stdio.h>

#include<string.h>

#include<algorithm>

using namespace std;

char a[5];

int main()

{

	scanf("%s",a);

	int l=strlen(a);

	sort(a,a+4);

	if(a[0]==a[1]&&a[2]==a[3]&&a[0]!=a[2])printf("Yes\n");

	else printf("No\n");

}