A Complementary Quine Write a quine that outputs the complement of the source code from the smallest containing power of two. Here's an example:

IN : source
OUT: \r\x11\x0b\x0e\x1d\x1b


The largest code point in the string "source" is the letter u, which is 117. The smallest containing power of 2 would be 128, so all the code points are taken as complements from 128.


s: 128 - 115 = 13. Code point 13 is a carriage return.
o: 128 - 111 = 17. Code point 17 is "device control 1"
u: 128 - 117 = 11. Code point 11 is a vertical tab.


And et cetera. Here's another example:

IN : R¡Ṡ
OUT: ᾮὟƠ


The largest code point is the character Ṡ, which is 7776. The smallest containing power of 2 is 2^13 (8192), so each character is complemented from 8192.

All of the standard loopholes apply. A program must consist of some explicit data or code. A variable containing some data by default would be considered implicit data, and therefore not allowed.

If your language inevitably outputs a trailing newline, it can be disregarded.
Retina, 2 1 byte

P


Outputs

0


Explained

P actually has no special meaning in retina, but retina treats it like a regex against the input, and counts the matches. As there's no input, there's no matches, so it returns 0, which is the exact inverse of this.

Try it online!

This is using an older version of Retina, which outputs a newline with the zero. This is not the case in the latest version.