ECOO '21 Practice P2 - High Fiver!

View as PDF

Submit solution

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 128M

Author:
Problem types

Note this problem was originally intended for the cancelled 2020 Girls Invitational Competition.

Yvonne Zhang loves to give high fives. She's picky about who she will high five and will only high five a certain N times a day. However, Yvonne also forgets the number of times she high fives in a day. Can you determine if Yvonne is correct about the amount of high fives she gives in a day based on the following criteria?

  • Yvonne Zhang loves even numbers. She will only high five an even number of times by the end of the day.
  • Yvonne likes to high five each person 3 times in a row. (Hint: the total number of high fives Yvonne gives will be a multiple of 3.)
  • Yvonne has a fear of the number 2. The number of times she high fives by the end of the day will never end with the ones digit of '2'.

Input Specification

The only line of input will be an integer number N (1 \le N \le 1000000), representing the number of times Yvonne thinks she high fives in a day.

Output Specification

Output memer if Yvonne is incorrect about the number of high fives she gives. Output not a memer if Yvonne is correct about the number of high fives she gives.

Sample Input 1

999

Sample Output 1

memer

Sample Input 2

24

Sample Output 2

not a memer

Comments

There are no comments at the moment.