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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

int main(){

	int n, n1, n2, n3;

	scanf("%d", &n);

	n1=n%10;

	n2=(n/10)%10;

	n3=n/100;

		if(n1==7){

		puts("Yes");

}

		else if(n2==7){

		puts("Yes");			

}

		else if(n3==7){

		puts("Yes");

}

		else{

		puts("No");

}

	return 0;

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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

	cin>>n;

	while(n){

		int x=n%10;

		n/=10;

		if(x==7){

			flag=1;

			break;

		}

	}

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

	else cout<<"No"<<endl;

}

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

    scanf("%d",&t);

    while(t>0)

    {

        int x=t%10;

        t/=10;

        if(x==7)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

}


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

   int n;

   cin>>n;

   if(n%10==7)

      cout<<"Yes";

   else{

      n/=10;

      if(n%10==7)

      cout<<"Yes";

      else{

         n/=10;

         if(n==7)

            cout<<"Yes";

         else cout<<"No";

      }

   }

}


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

  string st;

  cin>>st;

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

    cout<<"Yes"<<endl;

  }else{

    cout<<"No"<<endl;

  }

  

  return 0;

}

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

{

    int N,digit,temp=0;

    cin >> N;

    while (N != 0)

    {

        digit = N % 10;

        if (digit == 7)

        {

            temp=1;

            break;

        }

        N = N / 10;

    }

    if (temp == 1)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

#define pi acos(-1)

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

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

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

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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

{

    string s;

    int i;

    cin >> s;



    for( i=0; i<s.size(); i++)

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int main()

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int  main(){

	int n,flag=0;

	cin>>n;

	while(n){

		int x=n%10;

		n/=10;

		if(x==7){

			flag=1;

			break;

		}

	}

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

	else cout<<"No"<<endl;

}

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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int main()

{

    int t;

    scanf("%d",&t);

    while(t>0)

    {

        int x=t%10;

        t/=10;

        if(x==7)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int main(){

   int n;

   cin>>n;

   if(n%10==7)

      cout<<"Yes";

   else{

      n/=10;

      if(n%10==7)

      cout<<"Yes";

      else{

         n/=10;

         if(n==7)

            cout<<"Yes";

         else cout<<"No";

      }

   }

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int main(){

  string st;

  cin>>st;

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

    cout<<"Yes"<<endl;

  }else{

    cout<<"No"<<endl;

  }

  

  return 0;

}

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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;







int main()

{

    int N,digit,temp=0;

    cin >> N;

    while (N != 0)

    {

        digit = N % 10;

        if (digit == 7)

        {

            temp=1;

            break;

        }

        N = N / 10;

    }

    if (temp == 1)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

#define ll long long

#define nl "\n"

#define pi acos(-1)

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

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

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

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;

int main()

{

    string s;

    int i;

    cin >> s;



    for( i=0; i<s.size(); i++)

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

int main(){

	int n,a1,a2,a3;

	scanf("%d", &n);

	

	a3=n % 10;

	a2=(n/10)%10;

	a1= n/100;

	

	if(a3==7){

	puts("Yes");

}

	else if(a2==7){

	puts("Yes");

}

	else if(a1==7){

	puts("Yes");

}

	else{

	puts("No");

}

	return 0;

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int main()

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int  main(){

	int n,flag=0;

	cin>>n;

	while(n){

		int x=n%10;

		n/=10;

		if(x==7){

			flag=1;

			break;

		}

	}

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

	else cout<<"No"<<endl;

}

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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int main()

{

    int t;

    scanf("%d",&t);

    while(t>0)

    {

        int x=t%10;

        t/=10;

        if(x==7)

        {

            cout<<"Yes"<<endl;

            return 0;

        }

    }

    cout<<"No"<<endl;

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int main(){

   int n;

   cin>>n;

   if(n%10==7)

      cout<<"Yes";

   else{

      n/=10;

      if(n%10==7)

      cout<<"Yes";

      else{

         n/=10;

         if(n==7)

            cout<<"Yes";

         else cout<<"No";

      }

   }

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int main(){

  string st;

  cin>>st;

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

    cout<<"Yes"<<endl;

  }else{

    cout<<"No"<<endl;

  }

  

  return 0;

}

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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;







int main()

{

    int N,digit,temp=0;

    cin >> N;

    while (N != 0)

    {

        digit = N % 10;

        if (digit == 7)

        {

            temp=1;

            break;

        }

        N = N / 10;

    }

    if (temp == 1)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

#define ll long long

#define nl "\n"

#define pi acos(-1)

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

#define pcase printf("Case %d:\n",ca)

int ca=1;

using namespace std;

int main(){

    string a;

    cin>>a;

    bool ans = false;

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

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

            ans = true;

        }

    }

    if(ans == true){

        cout<<"Yes"<<nl;

    }else{

    cout<<"No"<<nl;}

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    int i;

    cin >> s;



    for( i=0; i<s.size(); i++)

    {

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

        {



            cout<<"Yes";

            return 0;

        }



    }

    cout<<"No";

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_io;

    int n;

    cin >> n;

    int a,cnt=0;

    while( n != 0)

    {

        a = n % 10;

        n = n / 10;

        if(a == 7)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "Yes\n";

    }

    else

    {

        cout << "No\n";

    }

}


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

int main(){

	int angka, digitBelakang, digitTengah, digitAwal;

	scanf("%d", &angka);

	

	digitBelakang = angka % 10;

	

    digitTengah = (angka - digitBelakang) / 10 % 10;

   	

    digitAwal = (angka - digitBelakang) / 100 % 10 ;

	

	if (digitBelakang == 7){

		puts ("Yes");

	}

	else if (digitTengah == 7){

		puts ("Yes");

	}

	else if (digitAwal == 7){

		puts ("Yes");

	}

	else {

		puts ("No");

	}

	return 0;

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

#include<cstdio>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<cmath>

#include<vector>

#include<map>

using namespace std;

string s[10005];

int main() 

{

	int n;

    cin>>n;

    int flag=0;

    while (n!=0)

    {

        int m=n%10;

        if (m==7)

        {

            flag=1;

            break;

        }

        n=n/10;

    }

    if (flag)

    cout<<"Yes"<<endl;

    else

    cout<<"No"<<endl;

    return 0;

}




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



int main(){

	int N;

	scanf("%d", &N);

	

	int a = N / 100, b = (N - a * 100) / 10, c = N % 10;

	

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

		puts("Yes");

	}

	else{

		puts("No");

	}

	

	return 0;

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

using namespace std;

int main()

{

	int n;

	cin>>n;

	if(n/100!=7&&n%10!=7&&(n%100)/10!=7)

		cout<<"No"<<endl;

	else cout<<"Yes"<<endl;

	

	return 0; 

}

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



int main(){

	int N;

	scanf("%d", &N);

	

	int a = N / 100, b = (N - a * 100) / 10, c = N % 10;

	

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

		puts("Yes");

	}

	else{

		puts("No");

	}

	

	return 0;

}