stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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



int main () {

	int X ;

	

	scanf ("%d", &X);

	X >= 30 ? printf ("Yes") : printf ("No");

	

	return 0;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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



int main () {

	int X ;

	

	scanf ("%d", &X);

	X >= 30 ? printf ("Yes") : printf ("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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



int main() {

	int X;

	int Y = 30;

	

	scanf("%d", &X);

	X>=Y ? printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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



int main () {

    int X ;

    scanf("%d", &X) ;

    X>=30? printf("Yes"):printf("No") ; 



    return 0 ;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include <iostream>

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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

#include <string.h>



int main(){

	

	int temp;

	scanf("%d", &temp);

	

	(temp>=30) ? printf("Yes"):printf("No");

	

	return 0 ;

}



//  \N JANGAN LUPA!!!!!
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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



int main(){

	

	int t;

	

	

	scanf("%d", &t);

	t>=30 ? printf ("Yes") : printf ("No");

	

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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

#include <string.h>



int main() {

	int S;

	

	scanf("%d", &S);

	!(S<30) && (S>=30) ? 

	printf("Yes") : printf("No");

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

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



}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int N;

    cin>>N;

    if(N>=30)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

    return 0;

}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30)

    {

        cout<<"Yes"<<endl;

    }

    else{

        cout<<"No"<<endl;

    }

    return 0;

}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;

    if(x>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;

    return 0;

}

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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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



using namespace std;



int main()

{

    int tem;

    cin>>tem;

    if(tem>=30)

        cout<<"Yes"<<endl;

    else

       cout << "No" << endl;

    return 0;

}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    if(n>=30)

        cout<<"Yes\n";

    else

        cout<<"No\n";

}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;



 if(X>=30)

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }



 return 0;





}


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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

#include <cstring>

#include <cstdio>

#include <cmath>

#include <queue>

#include <set>

#include <map>

#include <vector>

#include <stack>

#include <algorithm>

#define forn(a, n) for(int a = 0; a<(int) (n); ++a)

#define rforn(a, n) for(int a = (n)-1; a>=0; --a)

using namespace std;

const int N = 6e5+20;



int main()

{

    int n, m, b;

    cin>>n;

    if(n>=30) cout<<"Yes"<<endl;

    else cout<<"No"<<endl;



}

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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

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

using namespace std;



int main() {

	int n;

	cin >> n;

	if(n >= 30)cout << "Yes\n";

	else cout << "No\n";

}

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

int main()

{

	int X;

	scanf("%d",&X);

	if(X>=30)

	{

		printf("Yes");

	}

	else 

	{

		printf("No");

	}

	return 0;

}