#include<iostream>
#include <cstdlib>
#include<vector>
using namespace std;
#define vc vector<int>;
#define vcl vector<long int>
#define cin(a)
void merge(vector<long int> &arr, long int l, long int m, long int r) 
{ 
    long int i, j, k; 
    long int n1 = m - l + 1; 
    long int n2 =  r - m; 
  
    /* create temp arrays */
    long int L[n1], R[n2]; 
  
    /* Copy data to temp arrays L[] and R[] */
    for (i = 0; i < n1; i++){
        L[i] = arr[l + i];
    }
    for (j = 0; j < n2; j++){ 
        R[j] = arr[m + 1+ j];
    }
  
    /* Merge the temp arrays back into arr[l..r]*/
    i = 0; // Initial index of first subarray 
    j = 0; // Initial index of second subarray 
    k = l; // Initial index of merged subarray 
    while (i < n1 && j < n2) 
    { 
        if (L[i] <= R[j]) 
        { 
            arr[k] = L[i];
            i++; 
        } 
        else
        { 
            arr[k] = R[j]; 
            j++; 
        } 
        k++; 
    } 
  
    /* Copy the remaining elements of L[], if there 
       are any */
    while (i < n1) 
    { 
        arr[k] = L[i]; 
        i++; 
        k++; 
    } 
  
    /* Copy the remaining elements of R[], if there 
       are any */
    while (j < n2) 
    { 
        arr[k] = R[j]; 
        j++; 
        k++; 
    } 
} 
  
/* l is for left index and r is right index of the 
   sub-array of arr to be sorted */
void mergeSort(vector<long int> &arr, long int l, long int r) 
{ 
    if (l < r) 
    { 
        // Same as (l+r)/2, but avoids overflow for 
        // large l and h 
        int m = l+(r-l)/2; 
  
        // Sort first and second halves 
        mergeSort(arr, l, m); 
        mergeSort(arr, m+1, r); 
  
        merge(arr, l, m, r); 
    } 
}
bool chec(long int x,long int y,long int z){
    if((x+y>z)&&(z-y<x))return true;
    else return false;
}

int main(){
    long int t;
    cin>>t;
    long long sum=0;
    for(long int i=0;i<t;i++){
        if((i%5!=0)&&(i%3!=0))sum=sum+i;
        }

} 