pole = [1,2,1,2,3,5,2,1,1,1,2,3,4,2,1]
# N cisel z rozsahu 1 az M
#spocitaj pocetnosti cez vybrane podpostupnosti
#zloz. N*M
pocet = [len([x for x in pole if x==i ]) for i in range(1,6)]
print(max(pocet))
#pocitaj priebezne
#zloz. N+M
pocet = [0]*len(pole)
for x in pole:
pocet[x] = pocet[x]+1
print(max(pocet))
cG9sZSA9IFsxLDIsMSwyLDMsNSwyLDEsMSwxLDIsMyw0LDIsMV0KIyBOIGNpc2VsIHogcm96c2FodSAxIGF6IE0KCiNzcG9jaXRhaiBwb2NldG5vc3RpIGNleiB2eWJyYW5lIHBvZHBvc3R1cG5vc3RpCiN6bG96LiBOKk0KcG9jZXQgPSBbbGVuKFt4IGZvciB4IGluIHBvbGUgaWYgeD09aSBdKSBmb3IgaSBpbiByYW5nZSgxLDYpXQpwcmludChtYXgocG9jZXQpKQoKI3BvY2l0YWogcHJpZWJlem5lCiN6bG96LiBOK00KcG9jZXQgPSBbMF0qbGVuKHBvbGUpCmZvciB4IGluIHBvbGU6Cglwb2NldFt4XSA9IHBvY2V0W3hdKzEKcHJpbnQobWF4KHBvY2V0KSkJCg==