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



using namespace std;



int main(){

    char c[5]={0};

    cin>>c;

    int T=5,f=0;

    while(T--){

        if(c[T]=='7'){

            f=1;

            break;

        }

    }

    if(f) cout<<"Yes";

    else cout<<"No";

    return 0;

}

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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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

#define pb push_back

#define mp make_pair

#define F(i,n) for (int i = 0; i < n; ++i)

#define F1(i,n) for (int i = 1; i <= n; ++i)

#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)

typedef long long ll;

using namespace std;

vector<int>ivec;

vector<long long>lvec;

vector< pair<int, int> > pvec;

set< int, greater<int> >gset;

set<int, less<int> >lset;

set< int, greater<int> > ::iterator s;

void setprint()

 {

     set<int>so;

     set<int> :: iterator s;

     for(s=so.begin();s!=so.end();s++)

        cout<<*s<<" ";

 }



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    /*

    {

       Md: Saroar Zahan Sojib

       Green University of Bangladesh

       https://web.facebook.com/sojib.bdb

    }

   */



  int n;

  cin>>n;

  vector<int>vec;

  int reminder;

  while(n!=0)

  {

      reminder=n%10;

      n=n/10;

      vec.push_back(reminder);

  }

  int count=0;

  for(auto x:vec)

  {

      if(x==7)

      {

          count++;

      }

  }

  if(count==0)cout<<"No"<<endl;

  else

    cout<<"Yes"<<endl;



}

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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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

using namespace std;



int main(){

    int num;

    cin>>num;



    while(num != 0){

        int temp = num%10;

        if(temp == 7){

            cout<<"Yes"<<endl;

            return 0;

        }

        num /= 10;

    }

    cout<<"No"<<endl;

    return 0;

}


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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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



using namespace std;



int main()

{

    int n;



    cin >> n;



    bool flg=0;



    while(n!=0)

    {

        if(n%10==7)

        {

            flg=1;

            cout << "Yes" << endl;

            break;



        }



        n=n/10;



    }



    if(flg==0)

    {

        cout << "No" <<endl;

    }

    return 0;

}


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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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



using namespace std;



int main()

{

    int n, fact = 1;



    scanf("%d", &n);



    int t = n;



    while(t) {

        t = t / 10;

        fact = fact * 10;

    }



    while(fact > 1) {

        fact = fact / 10;

        if(n / fact == 7) {

            printf("Yes\n");

            return 0;

        }

        n = n % fact;

    }

    printf("No\n");



    return 0;

}

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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    int n;

    cin >> n;

    bool found = false;

    while(n != 0)

    {

        if(n % 10 == 7)

        {

            found = true;

            break;

        }

        n /= 10;

    }

    if(found)

    {

        cout << "Yes";

    }

    else

    {

        cout << "No";

    }

}


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



int main (){

	int N;

	int a;

	scanf("%d", &N);

	

	a = N / 10;

	

	if ( N % 10 == 7){

		printf("Yes");

	}

	else if ( N / 100 == 7){

		printf("Yes");

	}

	else if ( a % 10 == 7){

		printf("Yes");

	}

	else {

		printf("No");

	}

	 

	return 0;

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

#define IO ios::sync_with_stdio(0), cin.tie(0) 

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    int n;

    cin >> n;

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

        cout << "Yes" << endl;

    } 

    else

    {

        cout << "No" << endl;

    }

    

    return 0;

}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

using namespace std;

int main(){

	string s;

	while(cin>>s){

		bool f=0;

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

			if(s[i]=='7')	f=1;

			if(f) puts("Yes");

			else puts("No");

	}

	return 0;

}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

using namespace std;

#define elif else if

typedef long long ll;

typedef unsigned long long ull;

#define DEBUG(x) cout<<(x)<<endl

#define TGET(a,b) get<b>(a)



int main()

{

    int n;

    scanf("%d", &n);

    int flag = 0;

    while(n)

    {

        if(n%10==7)

        {

            flag = 1;

        }

        n /= 10;

    }

    if(flag)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    

    return 0;

}


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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

#include<cmath>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cstdlib>

#include<queue>

#include<map>

#include<stack>

#include<set>

#include<vector>

#include<functional>

using namespace std;

typedef long long LL;

bool flag=0;

inline LL read()

{

	LL kk=0,f=1;

	char cc=getchar();

	while(cc<'0'||cc>'9'){if(cc=='-')f=-1;cc=getchar();}

	while(cc>='0'&&cc<='9'){if(cc-'0'==7)flag=1;kk=(kk<<1)+(kk<<3)+cc-'0';cc=getchar();}

	return kk*f;

}

int main()

{

	int k=read();

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

	else printf("No\n");

}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		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;

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

	{

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

		{

			puts("Yes");

			return 0;

		}

	}

	puts("No");

 } 

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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



using namespace std;



int main(){

    char c[5]={0};

    cin>>c;

    int T=5,f=0;

    while(T--){

        if(c[T]=='7'){

            f=1;

            break;

        }

    }

    if(f) cout<<"Yes";

    else cout<<"No";

    return 0;

}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

#define pb push_back

#define mp make_pair

#define F(i,n) for (int i = 0; i < n; ++i)

#define F1(i,n) for (int i = 1; i <= n; ++i)

#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)

typedef long long ll;

using namespace std;

vector<int>ivec;

vector<long long>lvec;

vector< pair<int, int> > pvec;

set< int, greater<int> >gset;

set<int, less<int> >lset;

set< int, greater<int> > ::iterator s;

void setprint()

 {

     set<int>so;

     set<int> :: iterator s;

     for(s=so.begin();s!=so.end();s++)

        cout<<*s<<" ";

 }



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    /*

    {

       Md: Saroar Zahan Sojib

       Green University of Bangladesh

       https://web.facebook.com/sojib.bdb

    }

   */



  int n;

  cin>>n;

  vector<int>vec;

  int reminder;

  while(n!=0)

  {

      reminder=n%10;

      n=n/10;

      vec.push_back(reminder);

  }

  int count=0;

  for(auto x:vec)

  {

      if(x==7)

      {

          count++;

      }

  }

  if(count==0)cout<<"No"<<endl;

  else

    cout<<"Yes"<<endl;



}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

using namespace std;



int main(){

    int num;

    cin>>num;



    while(num != 0){

        int temp = num%10;

        if(temp == 7){

            cout<<"Yes"<<endl;

            return 0;

        }

        num /= 10;

    }

    cout<<"No"<<endl;

    return 0;

}


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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==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;



    bool flg=0;



    while(n!=0)

    {

        if(n%10==7)

        {

            flg=1;

            cout << "Yes" << endl;

            break;



        }



        n=n/10;



    }



    if(flg==0)

    {

        cout << "No" <<endl;

    }

    return 0;

}


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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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



using namespace std;



int main()

{

    int n, fact = 1;



    scanf("%d", &n);



    int t = n;



    while(t) {

        t = t / 10;

        fact = fact * 10;

    }



    while(fact > 1) {

        fact = fact / 10;

        if(n / fact == 7) {

            printf("Yes\n");

            return 0;

        }

        n = n % fact;

    }

    printf("No\n");



    return 0;

}

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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    int n;

    cin >> n;

    bool found = false;

    while(n != 0)

    {

        if(n % 10 == 7)

        {

            found = true;

            break;

        }

        n /= 10;

    }

    if(found)

    {

        cout << "Yes";

    }

    else

    {

        cout << "No";

    }

}


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

 

int main(){

	int N;

	scanf("%d", &N);

	if( N%10==7 || (N%100)/10==7 || N/100==7)

		printf("Yes\n");

	else

		printf("No\n");

	return 0;

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

#define IO ios::sync_with_stdio(0), cin.tie(0) 

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    int n;

    cin >> n;

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

        cout << "Yes" << endl;

    } 

    else

    {

        cout << "No" << endl;

    }

    

    return 0;

}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

using namespace std;

int main(){

	string s;

	while(cin>>s){

		bool f=0;

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

			if(s[i]=='7')	f=1;

			if(f) puts("Yes");

			else puts("No");

	}

	return 0;

}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

using namespace std;

#define elif else if

typedef long long ll;

typedef unsigned long long ull;

#define DEBUG(x) cout<<(x)<<endl

#define TGET(a,b) get<b>(a)



int main()

{

    int n;

    scanf("%d", &n);

    int flag = 0;

    while(n)

    {

        if(n%10==7)

        {

            flag = 1;

        }

        n /= 10;

    }

    if(flag)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    

    return 0;

}


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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

#include<cmath>

#include<iostream>

#include<algorithm>

#include<cstring>

#include<cstdlib>

#include<queue>

#include<map>

#include<stack>

#include<set>

#include<vector>

#include<functional>

using namespace std;

typedef long long LL;

bool flag=0;

inline LL read()

{

	LL kk=0,f=1;

	char cc=getchar();

	while(cc<'0'||cc>'9'){if(cc=='-')f=-1;cc=getchar();}

	while(cc>='0'&&cc<='9'){if(cc-'0'==7)flag=1;kk=(kk<<1)+(kk<<3)+cc-'0';cc=getchar();}

	return kk*f;

}

int main()

{

	int k=read();

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

	else printf("No\n");

}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        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;

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

	{

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

		{

			puts("Yes");

			return 0;

		}

	}

	puts("No");

 } 

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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



using namespace std;



int main(){

    char c[5]={0};

    cin>>c;

    int T=5,f=0;

    while(T--){

        if(c[T]=='7'){

            f=1;

            break;

        }

    }

    if(f) cout<<"Yes";

    else cout<<"No";

    return 0;

}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

#define pb push_back

#define mp make_pair

#define F(i,n) for (int i = 0; i < n; ++i)

#define F1(i,n) for (int i = 1; i <= n; ++i)

#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)

typedef long long ll;

using namespace std;

vector<int>ivec;

vector<long long>lvec;

vector< pair<int, int> > pvec;

set< int, greater<int> >gset;

set<int, less<int> >lset;

set< int, greater<int> > ::iterator s;

void setprint()

 {

     set<int>so;

     set<int> :: iterator s;

     for(s=so.begin();s!=so.end();s++)

        cout<<*s<<" ";

 }



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0);

    /*

    {

       Md: Saroar Zahan Sojib

       Green University of Bangladesh

       https://web.facebook.com/sojib.bdb

    }

   */



  int n;

  cin>>n;

  vector<int>vec;

  int reminder;

  while(n!=0)

  {

      reminder=n%10;

      n=n/10;

      vec.push_back(reminder);

  }

  int count=0;

  for(auto x:vec)

  {

      if(x==7)

      {

          count++;

      }

  }

  if(count==0)cout<<"No"<<endl;

  else

    cout<<"Yes"<<endl;



}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

using namespace std;



int main(){

    int num;

    cin>>num;



    while(num != 0){

        int temp = num%10;

        if(temp == 7){

            cout<<"Yes"<<endl;

            return 0;

        }

        num /= 10;

    }

    cout<<"No"<<endl;

    return 0;

}


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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

    } else if ((N - (N % 10) - ((((N - (N % 10)) / 10) % 10) * 10)) / 100 == 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;



    bool flg=0;



    while(n!=0)

    {

        if(n%10==7)

        {

            flg=1;

            cout << "Yes" << endl;

            break;



        }



        n=n/10;



    }



    if(flg==0)

    {

        cout << "No" <<endl;

    }

    return 0;

}


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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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



using namespace std;



int main()

{

    int n, fact = 1;



    scanf("%d", &n);



    int t = n;



    while(t) {

        t = t / 10;

        fact = fact * 10;

    }



    while(fact > 1) {

        fact = fact / 10;

        if(n / fact == 7) {

            printf("Yes\n");

            return 0;

        }

        n = n % fact;

    }

    printf("No\n");



    return 0;

}

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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

using namespace std;



#define ll long long

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



int main()

{

    fast_in_out;

    int n;

    cin >> n;

    bool found = false;

    while(n != 0)

    {

        if(n % 10 == 7)

        {

            found = true;

            break;

        }

        n /= 10;

    }

    if(found)

    {

        cout << "Yes";

    }

    else

    {

        cout << "No";

    }

}


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



int main() {

    int N;

    scanf("%d", &N);



    if(N % 10 == 7){

        printf("Yes\n");

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

        printf("Yes\n");

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

        printf("Yes\n");

    } else {

        printf("No\n");

    }



    return 0;

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

#define IO ios::sync_with_stdio(0), cin.tie(0) 

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 5;

const int inf = ~0u >> 1;

int main() {

    IO;

    int n;

    cin >> n;

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

        cout << "Yes" << endl;

    } 

    else

    {

        cout << "No" << endl;

    }

    

    return 0;

}

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

#include<string.h>

int main(){

	

	char s[100];

	scanf("%s",s);

	int count=0;

	for(int i=0; i<strlen(s); i++){

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

			count++;

		}else {

			continue;

		}

	}

	if(count>=1){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

}