#include using namespace std; // #define int long long /* cpp template {{{ */ /* short */ #define pb push_back #define mp make_pair #define print(x) cout << x << '\n' #define Fi first #define Se second /* REPmacro */ #define REPS(i, a, n) for (int i = (a); i < (n); i++) #define REP(i, n) for (int i = 0; i < (n); i++) #define RREP(i, n) for (int i = 1; i <= (n); i++) #define DEPS(i, a, n) for (int i = (a); i >= n; i--) #define DEP(i, n) for (int i = (n); i >= 0; i--) /* typedef */ typedef long long ll; typedef unsigned long long ull; typedef vector vi; typedef vector > vii; typedef pair pii; /* const */ const int INF = 999999999; const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; /* func */ inline bool is_uruu(int y) {return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0));} inline bool inside(int y, int x, int H, int W) {return (y >= 0 && x >= 0 && y < H && x < W);} /* }}} */ signed main() { ios::sync_with_stdio(false); string s; int n; cin >> n; RREP(i, n){ if (i % 15 == 0){ s += "FizzBuzz"; } else if (i % 3 == 0){ s += "Fizz"; } else if (i % 5 == 0){ s += "Buzz"; } else { s += 1 + '0'; } } int cnt = 0; REP(i, s.size()){ if (s[i] == 'z'){ cnt++; } } print(cnt); return (0); }