stablegradients/pie-gem5-pairs huggingface dataset:
// 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.3413508622432815x):
#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;

}
// 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.268000192893303x):
#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;

}
// 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.2549785623849266x):
#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;

}
// 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.296059727868532x):
#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;

}
// 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.27090268335935x):
#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;

}
// 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.46302832210558x):
#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;

}
// 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.33339895871078x):
#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;

}
// 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.33339895871078x):
#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;

}
// 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.2677456323651155x):
#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;

}
// 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.398527410356028x):
#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;

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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

using namespace std;

int main(){

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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

using namespace std;

typedef long long ll;

int main()

{

	string s;

	cin>>s;

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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

using namespace std;



int main(){

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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



using namespace std;



int main()

{

    int n;



    cin >> n;



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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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



using namespace std;



int main()

{

    int n, 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.252207821598358x):
#include<stdio.h>



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

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



int main()

{

    int n, r, temp, count=0;

    scanf("%d", &n);



   temp = n;

   while(temp>0)

   {

       r = temp%10;

       if(r==7)

        count=1;

       temp = temp/10;

   }

   if(count==1)

   printf("Yes\n");

   else

   printf("No\n");





    return 0;

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



using namespace std;



int main() {

string z,x;

cin>>x;

z="7";

int length,c;

length=x.size();

for(c=0;c<=length;c=c+1){

    if(z[0]==x[c]){

        cout<<"Yes";

        return 0;

    }

    }

    cout<<"No\n";

return 0;

}




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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

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

using namespace std;

	const int maxn=55;

	int a[maxn][maxn];

	int n;

	int main(){

		IOS

		bool ans=1;

		string s;

		cin>>s;

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

			cout<<"Yes"<<endl;

		else

			cout<<"No"<<endl;

		return 0;

	} 

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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

	int n,cnt=0;

	cin>>n;

	while(n)

	{

		if(n%10==7)

		   cnt++;

		n/=10;

	}

	if(cnt==0)

	    cout<<"No"<<endl;

	else

	    cout<<"Yes"<<endl;

	return 0;

}

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



int main() {

	char str[4];

	scanf("%s", str);

	if (str[0] == '7' || str[1] == '7' || str[2] == '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;

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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

	string n; 

	cin>>n;

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

	cout<<"Yes";

	else

	cout<<"No";



} 


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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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



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

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

#define ms(a, x) memset(a, x, sizeof(a))

#define F first

#define S second

#define all(x) (x).begin(),(x).end()



using namespace std;

typedef long long ll;

typedef pair<int, int> pii;

const int INF = 0x3f3f3f3f;

mt19937 gen(random_device{}());



int main() {

    ios::sync_with_stdio(false);

    cin.tie(nullptr);

    string st;

    cin>>st;

    if(st.find('7')!=st.npos) cout<<"Yes";

    else cout<<"No";

    return 0;

}




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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

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

    {

        char cc;

        cc=getchar();

        if(cc=='7'){cout<<"Yes"<<endl;return 0;}

    }

    cout<<"No"<<endl;

    return 0;

}


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



int main() {

	char str[4];

	scanf("%s", str);

	if (str[0] == '7' || str[1] == '7' || str[2] == '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;

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

        cout<<"Yes";

    }

    else cout<<"No";

}


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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

         string a;

         cin>>a;

         int c=0,i;

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

        {

           if(a[i]=='7') c++;

        }

 

         if(c>0) cout<<"Yes"<<endl;

         else cout<<"No"<<endl;

}

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



int main() {

	char str[4];

	scanf("%s", str);

	if (str[0] == '7' || str[1] == '7' || str[2] == '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\n";

            return 0;

        }

        n/=10;

    }

    cout<<"No\n";

}

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



int main() {

	char str[4];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else {

		printf("No\n");

	}

	return 0;

}