Having trouble answering this Turning Machine question:

Consider the following two languages:

L1 = { | M accepts at most 13 distinct inputs }

L2 = { | M accepts more than 13 distinct inputs }

Are these languages decidable? Are these languages recognizable? Prove your answers.