Case invert your quine Write a quine which attempts to invert the case of as many ascii characters in the source code as possible. For example in javascript:
(x=function(y){return ('(x='+y+')(x)').toUpperCase();})(x)


Standard quine rules apply.

The score is given by number of bytes in the source code - number of case inversions. For example, the quine above has a score of 29.

The program with the lowest score wins. If two programs have the same score then the shorter one wins.
&gt;&lt;&gt;, score 479 - 479 = 0
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllbfppllfepeeppppgglcepppbeppppppppppplfdppedpddpgglcdppbdpfcpecpggldcppllccpbcpplfbpebppldbppcbpggcbglefgpgbeglefgpgcbglefgpgggggedglefgpgccglefgpgfdglefgpgebglefgpgecglefgpggdcglefgpgceglefgpgeeglefgpgbcglefgpgfbglefgpgcdgfefgpbdgeefgpfegdefgpccgcefgpfdgbefgpdbgaefgpppddglefgpgbcglefgpgfcglefgpgdbglefgpgdcglefgpgecglefgpgddglefgpgdbglefgplffpbfgffgefgpcbgefgefgp

Try it online!
How it works
Very few useful instructions in &gt;&lt;&gt; are letters.
However, we still have the l, pushing the length of the stack to the stack. As such, it's possible to (very verbosely) push arbitrary values to the stack. Thus, strings can be encoded in a similar fashion to brainfuck, using a to increase the length of the stack, and g or p to reduce it.
As per usual quine rules, g is not used to read the source code itself, instead maintaining registers at locations such asbb and bc and so on.
The string encoded is the prefix:
&quot;r&amp;:20&amp;3-:&amp;?.p48*-od0l2)?.;lllll&quot;]&quot;
Which after over 7,000 instructions outputs the original string in upper case.