The repetitive byte counter Your task is to write a non-empty program / function of byte count L, which, when repeated M times, checks whether a given positive integer N is equal to L × M.

You should, in theory, support an arbitrary number of repetitions (an arbitrary positive integer value of M), but it's fine if, due to language limitations, it cannot work over a certain threshold.  Reading the source code of your program or accessing information about it is strictly forbidden. 

For providing output, you should choose a consistent value for one of the states (either truthy or falsy) and use any other (not necessarily consistent) possible output for the other state (Discussion).

Your answers will be scored by your initial program's length L (in bytes), with less bytes being better.

Example

Let's say your (initial) program is ABCDE. Then:


ABCDE (1 repetition) should check if the input equals 5.
ABCDEABCDE (2 repetitions) should check if the input equals 10.
ABCDEABCDEABCDE (3 repetitions) should check if the input equals 15. Etc...


The score of this sample code would be 5, as the initial source is 5 bytes long.
Jelly, 1 byte

’


Output is 0 for a match, non-zero for a non-match.

Try it online!

How it works

This makes advantage of the overly liberal output format. Repeating ’ M times simply decrements the input M times, so the result will be zero if and only if the input is LM, where L = 1.