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

#include <vector>

#include <algorithm>

using namespace std;

 

int w[1501]={0}, h[1501]={0};

int W[2250000]={0}, H[2250000]={0};

 

int sum(int* a , int i,int n,int size){

    int s = 0;

    for(int j=n ; j-- ; ){

        if( i >= size ){

            return 0;

        }

        s += a[i++];

    }

    return s;

}

 

int main(){

    int n,m,w_,h_;

    while( cin >> n >> m , n||m ){

        int cnt_w[1000000] = {0};

         

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

            cin >> h[i];

        }

        int pos=0;

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

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

                H[pos++] = sum( h , i , j , n );

            }

        }

         

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

            cin >> w[i];

        }

        int pos_2=0;

        for(int j=1 ; j <= m ; j++ ){

            for(int i=0 ; i+j <= m ; i++ ){

                W[pos_2++] = sum( w , i , j , m );

            }

        }

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

            cnt_w[ W[i] ] += 1;

        }

         

        int ans = 0;

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

        	ans += cnt_w[ H[i] ];

        }

        cout << ans << endl;

    }

}

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

#include <cstdio>

#include <vector>

#include <map>

#include <set>

#include <queue>

#include <stack>

#include <algorithm>

#include <string>

using namespace std;



int N, M;

int H[1502], W[1502];



int sum_h(int i, int j){

	return (H[i] - H[j+1]);

}



int sum_w(int i, int j){

	return (W[i] - W[j+1]);

}



int main(){

	while( cin >> N >> M, N || M ){

		vector<int> h(N), w(M);

		for(int i=0; i < N ; i++ ) cin >> h[i];

		for(int i=0; i < M ; i++ ) cin >> w[i];

		

		// テァツエツッテァツゥツ催・ツ陳?

		fill(H, H + 1500, 0);

		fill(W, W + 1500, 0);

		for(int i=0 ; i < N ; i++ ) H[0] += h[i];

		for(int i=0 ; i < M ; i++ ) W[0] += w[i];

		for(int i=1 ; i < N ; i++ ) H[i] = H[i-1] - h[i-1];

		for(int i=1 ; i < M ; i++ ) W[i] = W[i-1] - w[i-1];

		

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

			for(int j = i+1 ; j < N ; j++ ){

				h.push_back( sum_h(i, j) );

			}

		}

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

			for(int j = i+1 ; j < M ; j++ ){

				w.push_back( sum_w(i, j) );

			}

		}

		

		map<int,int> memo;

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

			if( memo.count( h[i] ) ){

				memo[h[i]]++;

			}else{

				memo[h[i]] = 1;

			}

		}

		int ans = 0;

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

			if( memo.count( w[i] ) ){

				ans += memo[w[i]];

			}

		}

		cout << ans << endl;

	}

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

	

	scanf("%d", &x);

	

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

	

	scanf("%d", &x);

	

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

int main ()

{

	int deggres;

	scanf ("%d", &deggres);

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

	scanf ("%d", &deggres);

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

	scanf ("%d", &deggres);

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

	scanf ("%d", &deggres);

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

	scanf ("%d", &deggres);

	deggres >= 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 temperatur;

	scanf("%d",&temperatur);

	temperatur>=30 ? printf("Yes\n"):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 temperatur;

	scanf("%d",&temperatur);

	temperatur>=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"<<endl;

    else

        cout<<"No"<<endl;

}


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

 

int main(){

	

	int temperatur;

	scanf("%d",&temperatur);

	temperatur>=30 ? printf("Yes\n"):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 temperatur;

	scanf("%d",&temperatur);

	temperatur>=30 ? printf("Yes\n"):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 temperatur;

	scanf("%d",&temperatur);

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

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

	return 0;

}

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



int main() {

	int degree;

	scanf("%d", &degree);

	

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



int main() {

	int degree;

	scanf("%d", &degree);

	

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



int main() {

	int degree;

	scanf("%d", &degree);

	

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



int main() {

	int degree;

	scanf("%d", &degree);

	

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



int main() {

	int degree;

	scanf("%d", &degree);

	

	degree >= 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 pemanas;

    

    scanf("%d", &pemanas);

    

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

    

    scanf("%d", &pemanas);

    

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

    

    scanf("%d", &pemanas);

    

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

    

    scanf("%d", &pemanas);

    

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

    

    scanf("%d", &pemanas);

    

    pemanas >= 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.2455746612462795x):
#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>

//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.303702775558831x):
#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.316152357317299x):
#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 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.274858021566282x):
#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.340366699428787x):
#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 temp;

	scanf("%d", &temp);

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

    else

        cout<<"No"<<endl;

}


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

	scanf("%d", &temp);

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

    scanf("%d",&X);

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

    scanf("%d",&X);

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

    return 0;

}