using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Numerics; using System.Runtime.CompilerServices; using System.Text; using static System.Convert; using static System.Math; using static Extensions; using static MathExtensions; public static class Program { public static void Solve() { var memo = new Dictionary { [0] = 1 }; long TermAt(long i) { if (memo.ContainsKey(i)) return memo[i]; return memo[i] = TermAt(i / 3) + TermAt(i / 5); } var n = L; Console.WriteLine(TermAt(n)); } #region Scanners static TextScanner _ts; static char C => char.Parse(_ts.Next()); static string S => _ts.Next(); static int I => int.Parse(_ts.Next()); static long L => long.Parse(_ts.Next()); static BigInteger B => BigInteger.Parse(_ts.Next()); static double D => double.Parse(_ts.Next()); static decimal M => decimal.Parse(_ts.Next()); #endregion public static void Main() { var sw = new StreamWriter(Console.OpenStandardOutput()); sw.NewLine = "\n"; #if DEBUG sw.AutoFlush = true; #else sw.AutoFlush = false; #endif Console.SetOut(sw); _ts = new TextScanner(Console.In); Solve(); Console.Out.Flush(); } } public static partial class Extensions { } #region Library #pragma warning disable public class TextScanner { private readonly TextReader _tr; public TextScanner(TextReader tr) { _tr = tr; } public string Next() { var sb = new StringBuilder(); int i; do { i = _tr.Read(); if (i == -1) throw new EndOfStreamException(); } while (char.IsWhiteSpace((char)i)); while (i != -1 && !char.IsWhiteSpace((char)i)) { sb.Append((char)i); i = _tr.Read(); } return sb.ToString(); } } [DebuggerStepThrough] public static partial class Extensions { [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Assert(bool condition) { if (!condition) throw new Exception("Assertion failed"); } public static string AsString(this IEnumerable source) => new string(source.ToArray()); public static Dictionary Bucket(this IEnumerable source) where T : IEquatable { var dict = new Dictionary(); foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1; return dict; } public static int[] Bucket(this IEnumerable source, int maxValue, Func selector) { var arr = new int[maxValue + 1]; foreach (var item in source) arr[selector(item)]++; return arr; } public static IEnumerable CumSum(this IEnumerable source) { var sum = 0; foreach (var item in source) yield return sum += item; } public static IEnumerable CumSum(this IEnumerable source) { var sum = 0L; foreach (var item in source) yield return sum += item; } public static void Exit(int exitCode) { Console.Out.Flush(); Environment.Exit(exitCode); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void ForEach(this IEnumerable source, Action action) { foreach (var item in source) action(item); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void ForEach(this IEnumerable source, Func func) { foreach (var item in source) func(item); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void ForEach(this IEnumerable source, Action action) { var i = 0; foreach (var item in source) action(item, i++); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void ForEach(this IEnumerable source, Func func) { var i = 0; foreach (var item in source) func(item, i++); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Repeat(int count, Action action) { for (var i = 0; i < count; i++) action(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Repeat(int count, Action action) { for (var i = 0; i < count; i++) action(i); } public static IEnumerable Repeat(int count, Func func) { for (var i = 0; i < count; i++) yield return func(); } public static IEnumerable Repeat(int count, Func func) { for (var i = 0; i < count; i++) yield return func(i); } public static void Swap(ref T x, ref T y) { var tmp = x; x = y; y = tmp; } public static (T1[], T2[]) Unzip(this ICollection<(T1, T2)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var i = 0; foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; } return (ts1, ts2); } public static (T1[], T2[], T3[]) Unzip(this ICollection<(T1, T2, T3)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var ts3 = new T3[source.Count]; var i = 0; foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; } return (ts1, ts2, ts3); } public static (T1[], T2[], T3[], T4[]) Unzip(this ICollection<(T1, T2, T3, T4)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var ts3 = new T3[source.Count]; var ts4 = new T4[source.Count]; var i = 0; foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; } return (ts1, ts2, ts3, ts4); } public static IEnumerable Zip(this IEnumerable first, IEnumerable second, IEnumerable thrid, Func resultSelector) { using (var e1 = first.GetEnumerator()) using (var e2 = second.GetEnumerator()) using (var e3 = thrid.GetEnumerator()) { while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext()) yield return resultSelector(e1.Current, e2.Current, e3.Current); } } public static IEnumerable Zip(this IEnumerable first, IEnumerable second, IEnumerable thrid, IEnumerable fourth, Func resultSelector) { using (var e1 = first.GetEnumerator()) using (var e2 = second.GetEnumerator()) using (var e3 = thrid.GetEnumerator()) using (var e4 = fourth.GetEnumerator()) { while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext()) yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current); } } } [DebuggerStepThrough] public static class MathExtensions { public static int DivCeil(int left, int right) => left / right + (left % right == 0 ? 0 : 1); public static long DivCeil(long left, long right) => left / right + (left % right == 0L ? 0L : 1L); public static int Gcd(int left, int right) { int r; while ((r = left % right) != 0) { left = right; right = r; } return right; } public static long Gcd(long left, long right) { long r; while ((r = left % right) != 0L) { left = right; right = r; } return right; } public static BigInteger Gcd(BigInteger left, BigInteger right) => BigInteger.GreatestCommonDivisor(left, right); public static int HighestOneBit(int x) { x |= x >> 01; x |= x >> 02; x |= x >> 04; x |= x >> 08; x |= x >> 16; return x - (x >> 1); } public static long HighestOneBit(long x) { x |= x >> 01; x |= x >> 02; x |= x >> 04; x |= x >> 08; x |= x >> 16; x |= x >> 32; return x - (x >> 1); } public static int Lcm(int left, int right) => left / Gcd(left, right) * right; public static long Lcm(long left, long right) => left / Gcd(left, right) * right; public static BigInteger Lcm(BigInteger left, BigInteger right) => left / Gcd(left, right) * right; public static int Pow(int value, int exponent) { var r = 1; while (exponent > 0) { if ((exponent & 1) == 1) r *= value; value *= value; exponent >>= 1; } return r; } public static long Pow(long value, int exponent) { var r = 1L; while (exponent > 0) { if ((exponent & 1) == 1) r *= value; value *= value; exponent >>= 1; } return r; } public static long Fact(int value) { var r = 1L; for (var i = 2; i <= value; i++) r *= i; return r; } } #pragma warning restore #endregion