Write it, run it, read the output

This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.

TASK

Implement groupedRule so the program applies the reusable divisibility rules to 27720 for every divisor from 1 through 20. Print each divisor with yes or no, then verify every printed result with the modulo operator and print the verification message.

1: yes
2: yes
3: yes
4: yes
5: yes
6: yes
7: yes
8: yes
9: yes
10: yes
11: yes
12: yes
13: no
14: yes
15: yes
16: no
17: no
18: yes
19: no
20: yes
All modulo checks passed