Number of characters skipped determines code printed Write a program which, when every nth character is skipped, it prints n. For example, if every 2nd character is skipped, it prints 2.

Example

n=0

foobar


Output:

0


n=1

foa


Output:

1


n=2

fobr


Output:

2


Rules


If n=0 (no characters are skipped), 0 must be returned.
Must print to STDOUT.
Standard loopholes are forbidden.
The first character is never skipped.
Obviously, it doesn't need to work for more characters than the code has (e.g. if your code is 11 characters long, it doesn't need to work for every 11th character)


Scoring

This is code golf, so the shortest code in bytes wins.
Polyglot, 1 byte

0


Try it in Retina

Try it in Jelly

Try it in 05AB1E

Try it in Husk

Try it in ///

Try it in GolfScript

Try it in BrainGolf

Try it in Pyth

Try it in Japt

Try it in ink

Try it in PHP

Try it in Brachylog

Try it in MATL

Try it in Keg

Try it in Carrot