Me at uni: Let N = 2^2^…^2, n times, and G be a graph of size N, then using Szemeredis Regularity lemma…

Me at home: We have like 8-9 apples left honey, do you really need a precise number?