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

using namespace std;

int main()

{

    int n,res=0;

    scanf("%d",&n);

    while(1)

    {

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

        else{

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

        return 0;

        }

    }

    return 0;

}


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

int main() {

	

	int num, fnt, mdl, bck;

	scanf("%d", &num);

	

	fnt = num / 100;

	mdl = num / 10 % 10;

	bck = num % 100 % 10;

	

	if (fnt != 7){

		if (mdl != 7){

			if (bck != 7){

				printf("No");

			}

			else printf("Yes");

		}

		else printf("Yes");

	}

	else printf("Yes");



	

	return 0;

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

using namespace std;

int main()

{

    int n;

    cin>>n;

    while(n)

    {

        if(n%10==7){cout<<"Yes"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	printf("Yes\n");

}

else{

	printf("No\n");

}



return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	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;



   int cnt=0;

   while(n>0){

    int x=n%10;

    if(x ==7)cnt++;

    n/=10;

   }

   if(cnt>0)cout<<"Yes\n" ;

   else

    cout<<"No\n" ;









return 0;



}


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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	printf("Yes\n");

}

else{

	printf("No\n");

}



return 0;

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

using namespace std;

#define ll long long int



int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

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

    int N;

    cin >> N;

    

    bool possible = false;

    while(N!=0){

        if(N%10==7){

            possible = true;

            break;

        }

        N/=10;

        

    }

    

    if(possible) cout << "Yes";

    else cout << "No";

}

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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	printf("Yes\n");

}

else{

	printf("No\n");

}



return 0;

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

#include<iostream>

//#include<map>

//#include<vector>

//#include<algorithm>

#define ll long long

#define endl "\n"

using namespace std;

//map<int,int>m;

/*

bool isprime[500+5];

vector<int>pf;

vector<int>arr;



void sieve()   // O(N lg lg N)

{

    int n=500; //sqrt of 2^31

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

    {

        isprime[i] = true;

    }

    isprime[0] = isprime[1] = false;

    for(int i = 2; i * i <= n; i++)

    {

        if(isprime[i] == true)

        {

            for(int j = i * i; j <= n; j += i)

            {

                isprime[j] = false;

            }

        }

    }

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

    {

        if(isprime[i])

        {

            pf.push_back(i); //store the prime numbers upto 10^8

        }

    }

} */

bool check(int n)

{

    int r;

    while(n>0)

    {

        r=n%10;

        if(r==7)

        {

            return true;

        }



        n=n/10;

    }

    return false;

}



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(0);//NULL;

    // sieve();

    int t;

    cin>>t;

    if(check(t))

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }







}






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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	printf("Yes\n");

}

else{

	printf("No\n");

}



return 0;

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

#define ll long long

using namespace std;



int main()

{

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

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

	ios_base::sync_with_stdio(false);

	cin.tie(0);

	cout.tie(0);

	string str;

	cin >> str;

	for (int i = 0; i < str.length(); i++)

	{

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

		{

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

			return 0;

		}

	}

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

	return 0;

}

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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	printf("Yes\n");

}

else{

	printf("No\n");

}



return 0;

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

using namespace std;

int main()

{

    int n,res=0;

    scanf("%d",&n);

    while(1)

    {

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

        else{

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

        return 0;

        }

    }

    return 0;

}


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

 

int main(){

	

int angka,ratusan,puluhan,satuan;

	

scanf("%d", &angka);

	

ratusan = angka % 100;

puluhan = ratusan % 10;

satuan = puluhan;

puluhan = ratusan / 10;

ratusan = angka / 100;

		

if (ratusan == 7){

	printf("Yes\n");

}

	

else if(puluhan == 7){

	printf("Yes\n");

}

	

else if(satuan == 7){

	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)

    {

        if(n%10==7){cout<<"Yes"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        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;



   int cnt=0;

   while(n>0){

    int x=n%10;

    if(x ==7)cnt++;

    n/=10;

   }

   if(cnt>0)cout<<"Yes\n" ;

   else

    cout<<"No\n" ;









return 0;



}


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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

using namespace std;

#define ll long long int



int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

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

    int N;

    cin >> N;

    

    bool possible = false;

    while(N!=0){

        if(N%10==7){

            possible = true;

            break;

        }

        N/=10;

        

    }

    

    if(possible) cout << "Yes";

    else cout << "No";

}

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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

#include<iostream>

//#include<map>

//#include<vector>

//#include<algorithm>

#define ll long long

#define endl "\n"

using namespace std;

//map<int,int>m;

/*

bool isprime[500+5];

vector<int>pf;

vector<int>arr;



void sieve()   // O(N lg lg N)

{

    int n=500; //sqrt of 2^31

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

    {

        isprime[i] = true;

    }

    isprime[0] = isprime[1] = false;

    for(int i = 2; i * i <= n; i++)

    {

        if(isprime[i] == true)

        {

            for(int j = i * i; j <= n; j += i)

            {

                isprime[j] = false;

            }

        }

    }

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

    {

        if(isprime[i])

        {

            pf.push_back(i); //store the prime numbers upto 10^8

        }

    }

} */

bool check(int n)

{

    int r;

    while(n>0)

    {

        r=n%10;

        if(r==7)

        {

            return true;

        }



        n=n/10;

    }

    return false;

}



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(0);//NULL;

    // sieve();

    int t;

    cin>>t;

    if(check(t))

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }







}






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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

#define ll long long

using namespace std;



int main()

{

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

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

	ios_base::sync_with_stdio(false);

	cin.tie(0);

	cout.tie(0);

	string str;

	cin >> str;

	for (int i = 0; i < str.length(); i++)

	{

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

		{

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

			return 0;

		}

	}

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

	return 0;

}

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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

using namespace std;

int main()

{

    int n,res=0;

    scanf("%d",&n);

    while(1)

    {

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

        else{

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

        return 0;

        }

    }

    return 0;

}


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

 

int main()

{

    int input, angka1, angka2, angka3;

    scanf("%d", &input);

    angka1 = input / 100;

    angka2 = input % 100 / 10;

    angka3 = input % 10;

    if(angka1 == 7 || angka2 == 7 || angka3 == 7)

    {

        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)

    {

        if(n%10==7){cout<<"Yes"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		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;



   int cnt=0;

   while(n>0){

    int x=n%10;

    if(x ==7)cnt++;

    n/=10;

   }

   if(cnt>0)cout<<"Yes\n" ;

   else

    cout<<"No\n" ;









return 0;



}


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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

#define ll long long int



int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

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

    int N;

    cin >> N;

    

    bool possible = false;

    while(N!=0){

        if(N%10==7){

            possible = true;

            break;

        }

        N/=10;

        

    }

    

    if(possible) cout << "Yes";

    else cout << "No";

}

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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

#include<iostream>

//#include<map>

//#include<vector>

//#include<algorithm>

#define ll long long

#define endl "\n"

using namespace std;

//map<int,int>m;

/*

bool isprime[500+5];

vector<int>pf;

vector<int>arr;



void sieve()   // O(N lg lg N)

{

    int n=500; //sqrt of 2^31

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

    {

        isprime[i] = true;

    }

    isprime[0] = isprime[1] = false;

    for(int i = 2; i * i <= n; i++)

    {

        if(isprime[i] == true)

        {

            for(int j = i * i; j <= n; j += i)

            {

                isprime[j] = false;

            }

        }

    }

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

    {

        if(isprime[i])

        {

            pf.push_back(i); //store the prime numbers upto 10^8

        }

    }

} */

bool check(int n)

{

    int r;

    while(n>0)

    {

        r=n%10;

        if(r==7)

        {

            return true;

        }



        n=n/10;

    }

    return false;

}



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(0);//NULL;

    // sieve();

    int t;

    cin>>t;

    if(check(t))

 {

     cout<<"Yes"<<endl;

 }

 else

 {

     cout<<"No"<<endl;

 }







}






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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

#define ll long long

using namespace std;



int main()

{

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

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

	ios_base::sync_with_stdio(false);

	cin.tie(0);

	cout.tie(0);

	string str;

	cin >> str;

	for (int i = 0; i < str.length(); i++)

	{

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

		{

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

			return 0;

		}

	}

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

	return 0;

}

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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    int n,res=0;

    scanf("%d",&n);

    while(1)

    {

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

    n=n/10;

    res=n%10;

    if(res-7==0){

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

        break;

    }

        else{

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

        return 0;

        }

    }

    return 0;

}


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



int main() {

	int num;

	scanf("%d", &num);

	int firstDigit, secondDigit, thirdDigit;

	//987 % 100 = 87

	firstDigit = num / 100;

	secondDigit = (num % 100) / 10;

	thirdDigit = num % 10;

	if (firstDigit == 7 || secondDigit == 7 || thirdDigit == 7) {

		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)

    {

        if(n%10==7){cout<<"Yes"<<endl;return 0;}n/=10;

    }cout<<"No";

}


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



int main (){



char num [10];

scanf ("%s", &num);



if (num[0] =='7'|| num [1] == '7'|| num [2] == '7'){

	printf ("Yes");

}

	else {

		printf ("No\n");

}



	return 0;

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

using namespace std;

string n;

int k;

int main(){

	cin>>n;

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

		k=n[i]-'0';

		if (k==7){

			cout<<"Yes"<<endl;

			return 0;

		}

	}

	cout<<"No"<<endl;

	return 0;

}

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



int main (){



char num [10];

scanf ("%s", &num);



if (num[0] =='7'|| num [1] == '7'|| num [2] == '7'){

	printf ("Yes");

}

	else {

		printf ("No\n");

}



	return 0;

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

using namespace std;



int main(){

    int n;

    cin>>n;



   int cnt=0;

   while(n>0){

    int x=n%10;

    if(x ==7)cnt++;

    n/=10;

   }

   if(cnt>0)cout<<"Yes\n" ;

   else

    cout<<"No\n" ;









return 0;



}


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



int main (){



char num [10];

scanf ("%s", &num);



if (num[0] =='7'|| num [1] == '7'|| num [2] == '7'){

	printf ("Yes");

}

	else {

		printf ("No\n");

}



	return 0;

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

using namespace std;

#define ll long long int



int main(){

    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

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

    int N;

    cin >> N;

    

    bool possible = false;

    while(N!=0){

        if(N%10==7){

            possible = true;

            break;

        }

        N/=10;

        

    }

    

    if(possible) cout << "Yes";

    else cout << "No";

}

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



int main (){



char num [10];

scanf ("%s", &num);



if (num[0] =='7'|| num [1] == '7'|| num [2] == '7'){

	printf ("Yes");

}

	else {

		printf ("No\n");

}



	return 0;

}