A Radiation Hardened Palindromic Quine There are radiation hardened quines, palindromic quines, but has anyone tried both?!
I think not!

Rules

So the challenge here is to make a quine that if any symbol is deleted it prints its original source code, and the quine needs to be the same read forward and backwards(before radiation damage)! All code will be scored based on bytes required to write it.

Things to avoid


Do not use any programs that are capable of directly examining their code and outputting it (that even means programs that take their source and dump it into some sort of data)
Do not use anything that somehow cheats all of this (like a function that outputs itself and some other character... please)


DO YOUR BEST!!!
Gol>&lt;>, 78 bytes

\&lt;"2ss}}l2%?:}a`(:&amp;K&amp;:&amp;]r&amp;[r~H&gt;.!01&lt;&lt;\

\&lt;&lt;10!.&gt;H~r[&amp;r]&amp;:&amp;K&amp;:(`a}:?%2l}}ss2"&lt;\


Try it online!

Verification!

A variation on the radiation hardened quine I posted yesterday. It's a little more complex since it needs to reverse the copied section using the undocumented [] operators, as well as redirect the pointer in one copy. If you're a little confused about why it doesn't look like a palindrome, remember that &gt;&lt;&gt; is a palindrome itself.