stablegradients/pie-gem5-pairs huggingface dataset:
// 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.321875800452076x):
#include <stdio.h>



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main () {

	int n;

	scanf("%d", &n);

	

	int firstDigit = n / 100;

	int secondDigit = (n / 10) % 10;

	int thirdDigit = n % 10;

	

	while ( n > 0) {

		if ( firstDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( secondDigit == 7) {

			puts("Yes");

			break;

		}

		else if ( thirdDigit == 7) {

			puts("Yes");

			break;

		}

		else {

			puts("No");

			break;

		}

	} 

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



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.2993084439313645x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.296100373669301x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.372216803749859x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.372672847320231x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.4109048486719775x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.254559183322502x):
#include <stdio.h>



int main(){

	

	int angka;

	scanf("%d", &angka);

	

	int angka3 = angka % 10;

 

	int angka2 = (angka - angka3) / 10;

	int angka2real = angka2 % 10;

	int angka1 = angka - (angka2real * 10) - angka3;

	int angka1real = angka1 / 100;

	

	if(angka1real == 7){

		printf("Yes\n");

	}

	else if(angka2real == 7){

		printf("Yes\n");

	}

	else if(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.368599461769541x):
#include <stdio.h>



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

    char arr[4];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == '7') return puts ("Yes"), 0;

    puts ("No");

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

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



int main(){

	int N;

	scanf("%d", &N);



	if (N / 100 == 7){

		puts("Yes");

	}else if ((N % 100)/10 == 7){

		puts("Yes");

	}else if (N % 10 == 7){

		puts("Yes");

	}else{

		puts("No");

	}

return 0;

}