As you should (hopefully) know, [a radiation hardened quine](https://en.wikipedia.org/wiki/Quine_(computing)#Radiation-hardened) is a quine that you can remove any one character from and still print its original, pre-modified source. The thing is, with most of these you can only remove one character; otherwise everything breaks down. This is where this comes in; your goal is to build a radiation-hardened quine that can take as many character removals as possible. Any language that complies with the rules is fine. 

Rules
-----

* The program must be at least one character long
* The language used must be turing complete (So languages like HQ9+ don't qualify)
* All other rules that apply to normal quines also apply here.
* The solution with the least `program_length^(2/n)` in which *any* set of exactly `n` characters can be removed while still printing the original source code wins.