Non-discriminating Programming We say a string is non-discriminating if each of the string's characters appears the same number of times and at least twice.

Examples


"aa!1 1 !a !1" is non-discriminating because each of the characters &#32;, !, a and 1 appear three times.
"abbaabb" is not non-discriminating because b appears more often than a.
"abc" is also not non-discriminating because the characters don't appear at least twice.


Task

Write a non-discriminating program or function which returns a truthy value if a given string is non-discriminating, and a falsy value otherwise.

That is, the program run on its own source code should return a truthy value.

Each submission must be able to handle non-empty strings containing printable ASCII, as well as all characters appearing in the source code of the submission.

Test Cases

Truthy:

&lt;your program's source code&gt;
"aaaa"
"aa!1 1 !a !1"
"aabbccddeeffgg"
"1Q!V_fSiA6Bri{|}tkDM]VjNJ=^_4(a&amp;=?5oYa,1wh|R4YKU #9c!#Q T&amp;f`:sm$@Xv-ugW&lt;P)l}WP&gt;F'jl3xmd'9Ie$MN;TrCBC/tZIL*G27byEn.g0kKhbR%&gt;G-.5pHcL0)JZ`s:*[x2Sz68%v^Ho8+[e,{OAqn?3E&lt;OFwX(;@yu]+z7/pdqUD"


Falsy:

"a"
"abbaabb"
"abc"
"bQf6ScA5d:4_aJ)D]2*^Mv(E}Kb7o@]krevW?eT0FW;I|J:ix %9!3Fwm;*UZGH`8tV&gt;gy1xX&lt;S/OA7NtB'}c u'V$L,YlYp{#[..j&amp;gTk8jp-6RlGUL#_&lt;^0CCZKPQfD2%s)he-BMRu1n?qdi/!5q=wn$ora+X,POzzHNh=(4{m`39I|s[+E@&amp;y&gt;"
Brachylog, 10 bytes

=ᵍbᵐbᵐlᵍ=l


Try it online!

Explanation

=ᵍ                Group all equal elements together
  bᵐbᵐ            Remove the first element of each group twice. This fails if
                  there are fewer than 2 elements
      lᵍ          Group elements together that have the same length
        =         Are all elements of that list equal? This only succeeds if the
                  list has one element
         l        Length. This will always succeed