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

using namespace std;

int x;

int main() {

	cin>>x;

	if(x>=30) {

		cout<<"Yes"<<endl;

	} else if (x<30) {

		cout<<"No"<<endl;

	}

}


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



#define pb push_back

#define MAX 100005

#define ff first

#define ss second

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }



void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



typedef long long ll;

typedef pair<int,int> pii;

typedef pair<ll, ll> pll;



int m;

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cin>>m;

    cout<<(m>=30?"Yes\n":"No\n");

}

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

	scanf("%d",&x);

	puts(x>=30?"Yes":"No");

	return 0;

}

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

//typedef long long ll;

using namespace std;

int main()

{

    {int x;cin>>x;if(x>=30)cout<<"Yes";else cout<<"No";}

}


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

int main() {

	cin>>x;

	if(x>=30) {

		cout<<"Yes"<<endl;

	} else if (x<30) {

		cout<<"No"<<endl;

	}

}


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



#define pb push_back

#define MAX 100005

#define ff first

#define ss second

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }



void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



typedef long long ll;

typedef pair<int,int> pii;

typedef pair<ll, ll> pll;



int m;

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cin>>m;

    cout<<(m>=30?"Yes\n":"No\n");

}

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

	scanf("%d",&x);

	puts(x>=30?"Yes":"No");

	return 0;

}

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

int main(){

	int x;

	scanf("%d", &x);

	if(x>=30) printf("Yes\n");

	else printf("No\n");

	return 0;

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

//typedef long long ll;

using namespace std;

int main()

{

    {int x;cin>>x;if(x>=30)cout<<"Yes";else cout<<"No";}

}


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

int main(){

	int x;

	scanf("%d", &x);

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

	scanf("%d", &x);

	if(x>=30) printf("Yes\n");

	else printf("No\n");

	return 0;

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

using namespace std;

int x;

int main() {

	cin>>x;

	if(x>=30) {

		cout<<"Yes"<<endl;

	} else if (x<30) {

		cout<<"No"<<endl;

	}

}


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

int main(){

	int x;

	scanf("%d", &x);

	if(x>=30) printf("Yes\n");

	else printf("No\n");

	return 0;

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

using namespace std;



#define pb push_back

#define MAX 100005

#define ff first

#define ss second

#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }



void err(istream_iterator<string> it) {}

template<typename T, typename... Args>

void err(istream_iterator<string> it, T a, Args... args) {

	cerr << *it << " = " << a << endl;

	err(++it, args...);

}



typedef long long ll;

typedef pair<int,int> pii;

typedef pair<ll, ll> pll;



int m;

int main(){

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cin>>m;

    cout<<(m>=30?"Yes\n":"No\n");

}

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

int main(){

	int x;

	scanf("%d", &x);

	if(x>=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";}

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



int main(){

    int x;

    scanf("%d", &x);

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



    return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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



int main(){

    int x;

    scanf("%d", &x);

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

    scanf("%d", &x);

    x>=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";}

// 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 X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.247866594657282x):
#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)cout<<"Yes";else cout<<"No";}

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



int main() {

	int x;

	scanf("%d", &x);

	

	printf("%s\n", x >= 30 ? "Yes" : "No");

	return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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



int main() {

	int x;

	scanf("%d", &x);

	

	printf("%s\n", x >= 30 ? "Yes" : "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.268977673911609x):
#include <stdio.h>



int main() {

	int x;

	scanf("%d", &x);

	

	printf("%s\n", x >= 30 ? "Yes" : "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";}

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



int main(){

	int x;

	scanf("%d", &x);

	if(x>=30) printf("Yes\n");

	else printf("No\n");

	return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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



int main(){

	int x;

	scanf("%d", &x);

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

	scanf("%d", &x);

	if(x>=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";}

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

#include <stdio.h>



int main () {

	int a;

	

	scanf ("%d", &a);

	

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





	return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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

#include <stdio.h>



int main () {

	int a;

	

	scanf ("%d", &a);

	

	a>=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 <string.h>

#include <stdio.h>



int main () {

	int a;

	

	scanf ("%d", &a);

	

	a>=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";}

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



int main(){

    int celcius;

    scanf("%d", &celcius);

    celcius > 29 ? printf("Yes\n") : printf("No\n");

    return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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



int main(){

    int celcius;

    scanf("%d", &celcius);

    celcius > 29 ? 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 celcius;

    scanf("%d", &celcius);

    celcius > 29 ? 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";}

// 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 X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.247866594657282x):
#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)cout<<"Yes";else cout<<"No";}

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



int main() {

    int dd;

    scanf("%d", &dd);

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



    return 0;

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



using namespace std;



int main()

{

    int X;

    scanf("%d",&X);

    if(X>=30)

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}


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



int main() {

    int dd;

    scanf("%d", &dd);

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

    scanf("%d", &dd);

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



    return 0;

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

using namespace std;



int x;



int main() {

	

	ios_base::sync_with_stdio(false);

	cin >> x;

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

	else cout << "No";

}

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



int main() {

    int dd;

    scanf("%d", &dd);

    dd >= 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);

	

	if(n >= 30){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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);

	

	if(n >= 30){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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);

	

	if(n >= 30){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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);

	

	if(n >= 30){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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);

	

	if(n >= 30){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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 derajat;

	scanf("%d", &derajat);

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

	scanf("%d", &derajat);

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

	scanf("%d", &derajat);

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

	scanf("%d", &derajat);

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

	scanf("%d", &derajat);

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

}