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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.30379148624169x):
#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;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














// Faster C++ solution for the same problem (measured speedup: 5.316672452825013x):
#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 || 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 X;

 cin>>X;

 if (X>=30)



   cout<<"Yes";

 else

   cout<<"No";

   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.30379148624169x):
#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||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

// Faster C++ solution for the same problem (measured speedup: 5.30379148624169x):
#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 a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.30379148624169x):
#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;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














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



int main (){

	int temp;

	scanf ("%d", &temp);

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

	

	

	return 0;

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

using namespace std;



int main() {

int X;

cin>>X;

if(X==30 || 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 temp;

	scanf ("%d", &temp);

	temp >= 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";

 else

   cout<<"No";

   return 0;

}


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



int main (){

	int temp;

	scanf ("%d", &temp);

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

	

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;



    if (x==30||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

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



int main (){

	int temp;

	scanf ("%d", &temp);

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

	

	

	return 0;

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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

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



int main (){

	int temp;

	scanf ("%d", &temp);

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

	

	

	return 0;

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

using namespace std;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














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



int main(){

	int n;

	scanf("%d", &n);

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

	

	return 0;

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

using namespace std;



int main() {

int X;

cin>>X;

if(X==30 || X>30)

cout<<"Yes"<<endl;

else

cout<<"No"<<endl;



    return 0;

}

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



int main(){

	int n;

	scanf("%d", &n);

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

	

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;

 if (X>=30)



   cout<<"Yes";

 else

   cout<<"No";

   return 0;

}


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



int main(){

	int n;

	scanf("%d", &n);

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

	

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;



    if (x==30||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

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



int main(){

	int n;

	scanf("%d", &n);

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

	

	return 0;

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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

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



int main(){

	int n;

	scanf("%d", &n);

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

	

	return 0;

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

using namespace std;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














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

int main(){

	int temperature;

	scanf("%d", &temperature);

	if(temperature >= 30){

		printf("Yes");

	}

	if(temperature <30){

		printf("No");

	}

	return 0;

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

using namespace std;



int main() {

int X;

cin>>X;

if(X==30 || X>30)

cout<<"Yes"<<endl;

else

cout<<"No"<<endl;



    return 0;

}

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

int main(){

	int temperature;

	scanf("%d", &temperature);

	if(temperature >= 30){

		printf("Yes");

	}

	if(temperature <30){

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;

 if (X>=30)



   cout<<"Yes";

 else

   cout<<"No";

   return 0;

}


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

int main(){

	int temperature;

	scanf("%d", &temperature);

	if(temperature >= 30){

		printf("Yes");

	}

	if(temperature <30){

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;



    if (x==30||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

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

int main(){

	int temperature;

	scanf("%d", &temperature);

	if(temperature >= 30){

		printf("Yes");

	}

	if(temperature <30){

		printf("No");

	}

	return 0;

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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

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

int main(){

	int temperature;

	scanf("%d", &temperature);

	if(temperature >= 30){

		printf("Yes");

	}

	if(temperature <30){

		printf("No");

	}

	return 0;

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

using namespace std;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














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

int main(){

	int temperature;

	scanf("%d", &temperature);

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

	return 0;

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

using namespace std;



int main() {

int X;

cin>>X;

if(X==30 || 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 temperature;

	scanf("%d", &temperature);

	temperature >= 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";

 else

   cout<<"No";

   return 0;

}


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

int main(){

	int temperature;

	scanf("%d", &temperature);

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

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;



    if (x==30||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

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

int main(){

	int temperature;

	scanf("%d", &temperature);

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

	return 0;

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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

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

int main(){

	int temperature;

	scanf("%d", &temperature);

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

	return 0;

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

using namespace std;

using ll = long long;

typedef pair<ll,ll> pll;

#define pb push_back

int main()

{

    ll t;



    cin>>t;



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

    else cout<<"No"<<endl;





}














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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;



int main() {

int X;

cin>>X;

if(X==30 || X>30)

cout<<"Yes"<<endl;

else

cout<<"No"<<endl;



    return 0;

}

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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

 int X;

 cin>>X;

 if (X>=30)



   cout<<"Yes";

 else

   cout<<"No";

   return 0;

}


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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    int x;

    cin>>x;



    if (x==30||x>=30)

        cout<<"Yes";

    else

        cout<<"No";

}

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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;



int main(){

  int a;

  cin >> a;

  if(a>=30){

 cout << "Yes";

  }

else{

 cout << "No";

}

  return 0;

}

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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;



int main() {

	int X;

	-40<=X<=40;

	cin >> X;

	if (X >= 30) {

		cout << "Yes" << endl;

	} else {

		cout << "No" << endl;

	}

}

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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std ;

int main()

{

    int X;

    cin>>X;

    if (X>=30)

    {

        cout<<"Yes";

    }

    else

    {

        cout<<"No";

    }

    return 0;

}


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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    int a;

    cin>>a;

    if(a>=30)

        cout<<"Yes"<<"\n";

    else

        cout<<"No"<<"\n";



}


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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	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.316337352005546x):
#include <stdio.h>



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	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.316054781541807x):
#include <stdio.h>



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	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;

}

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



int main(){

	int num;

	scanf("%d",&num);

	if (num >= 30){

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

	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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 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 a;

	scanf("%d", &a);

	if(a >= 30){

		printf("Yes");

	}

	else{

		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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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 suhu;

	scanf("%d", &suhu);

	suhu >= 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.316601828309841x):
#include <stdio.h>

int main()

{

	int degree;

	

	scanf("%i",&degree);



	degree >= 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.316601828309841x):
#include <stdio.h>

int main()

{

	int degree;

	

	scanf("%i",&degree);



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



	return 0;

}