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

#define mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t=3,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

   for(auto it:s)

    if(it=='7'){

        cout<<"Yes"<<endl;

        return 0;

    }

        cout<<"No"<<endl;

}








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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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

using namespace std;



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

typedef long long ll;



bool mew(int n) {

    while (n) {

        if (n%10 == 7) {

            return true;

        }

        n /= 10;

    }

    return false;

}



int main(){

    // ===================

    MorsheD;

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

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

    // ===================



    int n;

    cin >> n;



    if (mew(n)) {

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

    } else {

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

    }



    return 0;

}


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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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



using namespace std;



int main() {





    char a[3];

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

        cin>>a[i];

        if(a[i]=='7') {cout<<"Yes"<<endl; return 0;}

    }

    cout<<"No"<<endl;

    return 0;

}


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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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

#include<string>

using namespace std;



int main()

{

    bool con = false;

    string n;

    cin >> n;



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

    {

        if(n[i] == '7')

            con = true;

    }



    if(con)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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

using namespace std;



int main()

{

    int n,re,flag;

    while(cin>>n)

    {

        flag=0;

        while(n!=0)

        {

            re=n%10;

            if(re==7)

            {

                flag=1;

                break;

            }

            n=n/10;

        }

        if(flag==1)

            cout<<"Yes";

        else

            cout<<"No";

    }

}


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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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



using namespace std;



typedef long long ll;



int main()

{

    ll a;



    cin>> a;



    ll b = a;



        ll c3 = a %10;

        a /= 10;



        ll c2 = a % 10;

        a/=10;



        ll c1 = a %10;



    if(c1 == 7 || c2 == 7 || c3 == 7) cout<< "Yes\n";



    else cout<< "No\n";



	return 0;

}




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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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

#define ll long long

#define L long

#define endl "\n"

#define _START_ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define _END_ return 0;

using namespace std;



int main()

{   

    _START_



    int n;

    cin >> n;

    while (n != 0)

    {

        if (n % 10 == 7)

        {

            cout<< "Yes";

            return 0;

        }

        n /= 10;

    }

    cout<< "No";



    _END_

}

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

int main(){

	int n;

	scanf("%d" , &n);

	if (n%10 == 7 || (n/10) %10 == 7 || n/100 == 7) {

		puts("Yes\n");

	} 

	else{

		puts("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    char a[5];

    cin>>a;

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

    {

        if(a[i]=='7')

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

    return 0;

}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

#include<algorithm>

#include<cmath>

#include<cstdlib>

#include<cstdio>

#include<cstring>

#include<iomanip>

#include<string>

#include<set>

#include<map>

#include<vector>

#include<queue>

#include<stack>

#include<utility>

#define PI acos(-1.0)

using namespace std;

int main(){

	char a[3];

	for(int i =0;i < 3;i++) cin >> a[i];

	int flag = 0;

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

		if(a[i] == '7'){

			flag = 1;

			break;

		} 

	}

	if(flag) cout << "Yes" << endl;

	else cout << "No" << endl;

	return 0;

}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

typedef long long ll;

int main()

{

    string s;  cin>>s;

    if(s.find('7')!=-1)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

string s;

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	cin>>s;

	if(s[0]=='7'||s[1]=='7'||s[2]=='7') return cout<<"Yes",0;

	cout<<"No";

	return 0;

}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;



char s[5];

int n,flag;



int main()

{

	scanf("%s",s);

	n=strlen(s);

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

		{

			if(s[i]=='7')

				{

					printf("Yes");

					flag++;

					break;

				}

			

		}

	if(flag==0)printf("No");

	return 0;



	return 0;

}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;



int main(){

    int n; cin >> n;

    while(n > 0){

        if(n%10 == 7){

            cout << "Yes\n";

            return 0;

        }

        n /= 10;

    }

    cout << "No\n";

    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

#define FOR(I,A,B)          for(int I=A; I<B; I++)

#define LL                  long long

#define PII                 pair<int,int>

#define MOD                 1000000007

#define MAX                 1000005

#define READ(A)             freopen(A,"r",stdin)



int main() {

    char S[4];

    bool B=false;

    scanf("%s",S);

    FOR(I,0,3){

        if(S[I]=='7'){

            B=true;

        }

    }

    if(B)printf("Yes\n");

    else printf("No\n");

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

int main(){

    string n;

    int i;

    cin>>n;

    bool yes=false;

    for(i=0;i<3;i++){

        if(n[i]=='7'){

            yes=true;

            cout<<"Yes"<<endl;

            break;

        }



    }

    if(yes==false){

        cout<<"No"<<endl;

    }





    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

#define mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t=3,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

   for(auto it:s)

    if(it=='7'){

        cout<<"Yes"<<endl;

        return 0;

    }

        cout<<"No"<<endl;

}








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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;



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

typedef long long ll;



bool mew(int n) {

    while (n) {

        if (n%10 == 7) {

            return true;

        }

        n /= 10;

    }

    return false;

}



int main(){

    // ===================

    MorsheD;

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

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

    // ===================



    int n;

    cin >> n;



    if (mew(n)) {

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

    } else {

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

    }



    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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



using namespace std;



int main() {





    char a[3];

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

        cin>>a[i];

        if(a[i]=='7') {cout<<"Yes"<<endl; return 0;}

    }

    cout<<"No"<<endl;

    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

#include<string>

using namespace std;



int main()

{

    bool con = false;

    string n;

    cin >> n;



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

    {

        if(n[i] == '7')

            con = true;

    }



    if(con)

        cout << "Yes";

    else

        cout << "No";



    return 0;

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;



int main()

{

    int n,re,flag;

    while(cin>>n)

    {

        flag=0;

        while(n!=0)

        {

            re=n%10;

            if(re==7)

            {

                flag=1;

                break;

            }

            n=n/10;

        }

        if(flag==1)

            cout<<"Yes";

        else

            cout<<"No";

    }

}


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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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



using namespace std;



typedef long long ll;



int main()

{

    ll a;



    cin>> a;



    ll b = a;



        ll c3 = a %10;

        a /= 10;



        ll c2 = a % 10;

        a/=10;



        ll c1 = a %10;



    if(c1 == 7 || c2 == 7 || c3 == 7) cout<< "Yes\n";



    else cout<< "No\n";



	return 0;

}




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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

#define ll long long

#define L long

#define endl "\n"

#define _START_ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define _END_ return 0;

using namespace std;



int main()

{   

    _START_



    int n;

    cin >> n;

    while (n != 0)

    {

        if (n % 10 == 7)

        {

            cout<< "Yes";

            return 0;

        }

        n /= 10;

    }

    cout<< "No";



    _END_

}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

int main()

{

int N,a,b,c,d;

cin>>N;

c=N%10;

a=N/100;

d=N/10;

b=d%10;

if(a==7||b==7||c==7)

{

cout<<"Yes"<<endl;

}

else

{

cout<<"No"<<endl;

}

return 0;







}

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

int main()

{

    int n,i,d=0;

    scanf("%d",&n);

    while(n!=0)

    {

        i=n%10;

        if(i==7){printf("Yes");d=1;break;}

        n/=10;

    }

    if(d!=1)printf("No");

    return 0;

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

using namespace std;

int main()

{

    char a[5];

    cin>>a;

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

    {

        if(a[i]=='7')

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

    return 0;

}

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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

#include<algorithm>

#include<cmath>

#include<cstdlib>

#include<cstdio>

#include<cstring>

#include<iomanip>

#include<string>

#include<set>

#include<map>

#include<vector>

#include<queue>

#include<stack>

#include<utility>

#define PI acos(-1.0)

using namespace std;

int main(){

	char a[3];

	for(int i =0;i < 3;i++) cin >> a[i];

	int flag = 0;

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

		if(a[i] == '7'){

			flag = 1;

			break;

		} 

	}

	if(flag) cout << "Yes" << endl;

	else cout << "No" << endl;

	return 0;

}

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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;

typedef long long ll;

int main()

{

    string s;  cin>>s;

    if(s.find('7')!=-1)

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;

string s;

int main(){

	ios::sync_with_stdio(0);

	cin.tie(0);

	cin>>s;

	if(s[0]=='7'||s[1]=='7'||s[2]=='7') return cout<<"Yes",0;

	cout<<"No";

	return 0;

}

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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;



char s[5];

int n,flag;



int main()

{

	scanf("%s",s);

	n=strlen(s);

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

		{

			if(s[i]=='7')

				{

					printf("Yes");

					flag++;

					break;

				}

			

		}

	if(flag==0)printf("No");

	return 0;



	return 0;

}

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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        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;

    while(n > 0){

        if(n%10 == 7){

            cout << "Yes\n";

            return 0;

        }

        n /= 10;

    }

    cout << "No\n";

    return 0;

}


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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;

#define FOR(I,A,B)          for(int I=A; I<B; I++)

#define LL                  long long

#define PII                 pair<int,int>

#define MOD                 1000000007

#define MAX                 1000005

#define READ(A)             freopen(A,"r",stdin)



int main() {

    char S[4];

    bool B=false;

    scanf("%s",S);

    FOR(I,0,3){

        if(S[I]=='7'){

            B=true;

        }

    }

    if(B)printf("Yes\n");

    else printf("No\n");

}


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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;

int main(){

    string n;

    int i;

    cin>>n;

    bool yes=false;

    for(i=0;i<3;i++){

        if(n[i]=='7'){

            yes=true;

            cout<<"Yes"<<endl;

            break;

        }



    }

    if(yes==false){

        cout<<"No"<<endl;

    }





    return 0;

}


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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

#define mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t=3,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

   for(auto it:s)

    if(it=='7'){

        cout<<"Yes"<<endl;

        return 0;

    }

        cout<<"No"<<endl;

}








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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

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

using namespace std;



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

typedef long long ll;



bool mew(int n) {

    while (n) {

        if (n%10 == 7) {

            return true;

        }

        n /= 10;

    }

    return false;

}



int main(){

    // ===================

    MorsheD;

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

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

    // ===================



    int n;

    cin >> n;



    if (mew(n)) {

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

    } else {

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

    }



    return 0;

}


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



int main()

{

    int n, count=0;



    scanf("%d", &n);



    while(n != 0)

    {

        if(n % 10 == 7)

        {

            count++;

            break;

        }

        n = n/10;

    }



    if(count == 1)

        printf("Yes\n");

    else

        printf("No\n");



    return 0;

}