Problem:
Score : 200 points

Problem Statement

Let us define the FizzBuzz sequence a_1,a_2,... as follows:

If both 3 and 5 divides i, a_i=\mbox{FizzBuzz}.

If the above does not hold but 3 divides i, a_i=\mbox{Fizz}.

If none of the above holds but 5 divides i, a_i=\mbox{Buzz}.

If none of the above holds, a_i=i.

Find the sum of all numbers among the first N terms of the FizzBuzz sequence.

Constraints

1 \leq N \leq 10^6

Input

Input is given from Standard Input in the following format:

N

Output

Print the sum of all numbers among the first N terms of the FizzBuzz sequence.

Sample Input 1

15

Sample Output 1

60

The first 15 terms of the FizzBuzz sequence are:

1,2,\mbox{Fizz},4,\mbox{Buzz},\mbox{Fizz},7,8,\mbox{Fizz},\mbox{Buzz},11,\mbox{Fizz},13,14,\mbox{FizzBuzz}

Among them, numbers are 1,2,4,7,8,11,13,14, and the sum of them is 60.

Sample Input 2

1000000

Sample Output 2

266666333332

Watch out for overflow.

Solution in C++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define forn(i,n)for(ll i=0;i<(n);i++)
#define forn_rev(i,n)for(ll i=(n)-1;i>=0;i--)
#define for1n(i,n) for(ll i=1;i<=(n);i++)
#define ARRAY_SIZE(a) sizeof(a)/sizeof(*a)
#define MOD 1000000007
#define MAXN 100000

using namespace std;


void bfs(vector<vector<char>> &arr,ll &l,ll r,ll N,ll M){

    queue<pair<ll,ll>> q;
    q.push({l,r});
    while(!q.empty()){
        pair<ll,ll> a=q.front();

        q.pop();
        if(arr[a.first][a.second]=='.') arr[a.first][a.second]='B';
        char ch=arr[a.first][a.second];
        if(a.second>0 && arr[a.first][a.second-1]=='.') {
                q.push({a.first,a.second-1});
                if(ch=='B') arr[a.first][a.second-1]='W';
                else arr[a.first][a.second-1]='B';
        }
        if(a.second<M-1 && arr[a.first][a.second+1]=='.') {
                q.push({a.first,a.second+1});
                if(ch=='B') arr[a.first][a.second+1]='W';
                else arr[a.first][a.second+1]='B';
        }
        if(a.first>0 && arr[a.first-1][a.second]=='.') {
                q.push({a.first-1,a.second});
                if(ch=='B') arr[a.first-1][a.second]='W';
                else arr[a.first-1][a.second]='B';
        }
        if(a.first<N-1 && arr[a.first+1][a.second]=='.') {
                q.push({a.first+1,a.second});
                if(ch=='B') arr[a.first+1][a.second]='W';
                else arr[a.first+1][a.second]='B';
        }

    }

}


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);cout.tie(NULL);
    ll T=1;
    //cin>>T;
    while(T--)
    {
        ll N;
        cin>>N;
        ll ans=0;
        ll g;
        for1n(i,N){
            if(i%3==0 || i%5==0 || i%15==0){
                g=1;
            }
            else ans+=i;
        }
        cout<<ans;


    }





    return 0;
}