from ps2b import solve

# find the highest unsolvable combination of sizes

n = 6
consecutive = 0
last = 6

while consecutive < 6:
  s = solve(n)
  if s == (None, None, None):
    consecutive = 0
    last = n
  else:
    consecutive += 1
  n += 1

print('Highest unsolvable number of nuggets with combination of sizes: ', last)


08dca480dd13da89795fcd88960b619e0a522709
<mask token>

<mask token>
while consecutive < 6:
    s = solve(n)
    if s == (None, None, None):
        consecutive = 0
        last = n
    else:
        consecutive += 1
    n += 1
print('Highest unsolvable number of nuggets with combination of sizes: ', last)

<mask token>
n = 6
consecutive = 0
last = 6
while consecutive < 6:
    s = solve(n)
    if s == (None, None, None):
        consecutive = 0
        last = n
    else:
        consecutive += 1
    n += 1
print('Highest unsolvable number of nuggets with combination of sizes: ', last)

from ps2b import solve
n = 6
consecutive = 0
last = 6
while consecutive < 6:
    s = solve(n)
    if s == (None, None, None):
        consecutive = 0
        last = n
    else:
        consecutive += 1
    n += 1
print('Highest unsolvable number of nuggets with combination of sizes: ', last)

from ps2b import solve

# find the highest unsolvable combination of sizes

n = 6
consecutive = 0
last = 6

while consecutive < 6:
  s = solve(n)
  if s == (None, None, None):
    consecutive = 0
    last = n
  else:
    consecutive += 1
  n += 1

print('Highest unsolvable number of nuggets with combination of sizes: ', last)

