using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Convert; using static System.Math; using static Constants; using static Extensions; using static MathExtensions; public class Program { public static void Solve() { var a = I; var b = I; var ans = 0; foreach (var i in Range(a, b + 1)) { if ((a + b + i) / 3.0 == Ceiling((a + b + i) / 3.0)) ans++; } Console.WriteLine(ans); } #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 char[] Cs(int count) => Repeat(count, () => C).ToArray(); static string[] Ss(int count) => Repeat(count, () => S).ToArray(); static int[] Is(int count) => Repeat(count, () => I).ToArray(); static long[] Ls(int count) => Repeat(count, () => L).ToArray(); static BigInteger[] Bs(int count) => Repeat(count, () => B).ToArray(); static double[] Ds(int count) => Repeat(count, () => D).ToArray(); #endregion [DebuggerStepThrough] 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(); } } [DebuggerStepThrough] 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(); } } public static class Constants { public const int AnswerToLifeTheUniverseAndEverything = 42; public const string Yes = "Yes"; public const string No = "No"; public const string YES = "YES"; public const string NO = "NO"; public const string Possible = "Possible"; public const string Impossible = "Impossible"; public const string POSSIBLE = "POSSIBLE"; public const string IMPOSSIBLE = "IMPOSSIBLE"; } [DebuggerStepThrough] public static class Extensions { public static void Answer(object value) { Console.WriteLine(value); Exit(0); } 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 IComparer CreateDescendingComparer() where T : IComparable => Comparer.Create((x, y) => y.CompareTo(x)); 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); } public static void ForEach(this IEnumerable source, Action action) { foreach (var item in source) action(item); } public static void ForEach(this IEnumerable source, Func func) { foreach (var item in source) func(item); } public static void ForEach(this IEnumerable source, Action action) { var i = 0; foreach (var item in source) action(item, i++); } public static void ForEach(this IEnumerable source, Func func) { var i = 0; foreach (var item in source) func(item, i++); } // [l, r) public static bool IsIn(this T value, T l, T r) where T : IComparable { if (l.CompareTo(r) > 0) throw new ArgumentException(); return l.CompareTo(value) <= 0 && value.CompareTo(r) < 0; } public static IEnumerable Range(int start, int end, int step = 1) { for (var i = start; i < end; i += step) yield return i; } public static IEnumerable Range(int end) => Range(0, end); public static void Repeat(int count, Action action) { for (var i = 0; i < count; i++) action(); } 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 IEnumerable RangeReverse(int start, int end, int step = 1) { for (var i = end - 1; i >= start; i -= step) yield return i; } public static IEnumerable RangeReverse(int end) => RangeReverse(0, end); public static void Swap(ref T x, ref T y) { var tmp = x; x = y; y = tmp; } } [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; } }