To deny a n entry start is the purest relation proving relation Theory is that quicker than a cat can lick its tail , , The non option will succeed in overturning a positive desire amd n n fullfill a memory