#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)

                    
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7;
void chmod(ll &M){
  if(M >= mod) M %= mod;
  else if(M < 0){
     M += (abs(M)/mod + 1)*mod;
    M %= mod;
}
}
ll modpow(ll x, ll n){
   if(n==0) return 1;
  ll res=modpow(x, n/2);
 if(n%2==0) return res*res%mod;
else return res*res%mod*x%mod;
}
int getl(int i, int N) { return i==0? N-1:i-1; };
int getr(int i, int N) { return i==N-1? 0:i+1; };
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  else return GCD(b, a % b);
}

using namespace std;
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
/* <-----------------------------------------------------------------------------------> */
int main()
{
    string S;
    cin >> S;
    bool check = false;
    for (int i = 0; i < 3; i++) {
        if (S[i] == '7') {
            check = true;
            break;
        }
    }
    if (check) cout << "Yes" << endl;
    else cout << "No" << endl;
}


#include <stdio.h>

int main(){
	long long N, sum;
	scanf("%lld", &N);
	sum = N*(N+1)/2;

	long long Un3 = N/3;
	long long Sn3 = 3*(Un3*(Un3+1)/2);
	
	long long Un5 = N/5;
	long long Sn5 = 5*(Un5*(Un5+1)/2);
	
	long long Un15 = N/15;
	long long Sn15 = 15*(Un15*(Un15+1)/2);

	printf("%lld", sum-Sn3-Sn5+Sn15);
			
	return 0;
}