Code-Golf caddy Eddie Brackets was getting tired of quine challenges, which appeared to be much too easy for the grand poobahs. He has this idea to spice up things and is sending quines to the car crusher.
Challenge: Write a quine that prints itself "squeezed" for output purposes into an n x n square followed by that same square three more times, each time rotated 90 degrees to the right, for a total of 4 squares. (By squeezed quine, Eddie means one that has all its printable characters but has all the white space (spaces, tabs, line feeds) removed. Of course, it may or may not work as a real quine after being squeezed, but it's what Eddie is talking about for his output.)
Example: If a solution quine in some language were:
A%C~?5 F$G &G52[/<
its Output must be:
A%C~ ?5F$ G7G5 2[/< 2G?A [75% /GFC <5$~ </[2 5G7G $F5? ~C%A ~$5< CFG/ %57[ A?G2
All whitespace in the code counts toward the final byte count, but must be removed in the output squares. There must be at least 4 printable (i.e. visible, non whitespace) characters in the quine, i.e. a minimum of 16 printable characters output.
The four squares may be printed either horizontally or vertically, but must be separated by at least one space or delineating character(s) (horizontally) or at least one blank line or delineating character(s) (vertically). The first square is the "squeezed" program code (whitespace removed) printed n characters to a line. Nothing should appear between the output characters in each output square, which should each be a solid block of characters. Each square must contain all the printable characters of the quine.
Orientation of all characters in the rotated output remains just as it is in the code, e.g. < remains < and never changes to > or ^.
Code golf: shortest code in bytes wins.
In summary, your quine will have n^2 printable characters, and each of the four output squares will be n x n.