Appearing a unique number of times Your task is to write a program or function that takes as input a list of positive integers and determines if there are any two integers in the list, that both appear the same number of times.

For example the list

[1, 2, 3, 2]


Has one 1 and one 3 so it satisfies the condition.

But the list

[3, 2, 2, 1, 2, 3]


does not satisfy the condition since every member appears a unique number of times.

Additionally your program should not satisfy this condition when its source code is interpreted as a list of bytes.

For example

abcb


Would not be a valid submission since both a and c appear exactly once.

Here is a verifier you can use if your source is in ASCII.

Output

Your submission when executed should output one of two possible values, one when the input satisfies the condition, one when the input does not.

This is code-golf so answers will be scored in bytes with fewer bytes being better.
05AB1E, 6 bytes

D¢DD¢Q


Try it online! or validate more test cases.

Outputs 1 if each item appears a unique number of times, 0 otherwise.

D           # duplicate the input
 ¢          # count occurences of each item in the input
  DD        # triplicate the list of occurence counts
    ¢       # count occurences of each occurence count in the list of occurence counts
     Q      # check whether this is equal to the list of occurence counts


Without the source restriction, this could be 4 bytes: ¢Ð¢Q.