import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { string[] INPUT; try { for (; ; ) { INPUT ~= readToken(); } } catch (EOFException e) { } debug { writeln("INPUT = ", INPUT); } if (INPUT.length == 1) { try { const N = INPUT[0].to!int; if (N > 75) { writeln(N * (N + 1) / 2); } else { foreach (i; 1 .. N + 1) { if (i % 15 == 0) { writeln("FizzBuzz"); } else if (i % 3 == 0) { writeln("Fizz"); } else if (i % 5 == 0) { writeln("Buzz"); } else { writeln(i); } } } } catch (ConvException e) { writeln("Hello World!"); } } else { try { long[] values; foreach (input; INPUT) { values ~= input.to!long; } if (values.length == values[0] + 1) { writeln(values[1 .. $].sum); } else { writeln("Hello World!"); } } catch (ConvException e) { if (INPUT.length == 3) { writeln(INPUT[0].to!long + INPUT[1].to!long, " ", INPUT[2]); } else { writeln("Hello World!"); } } } }