Print the last answerer's first submission
user, Java (OpenJDK 8), 75 bytes

interface T{static void main(String[]a){System.out.print(&quot;print(\&quot;N\&quot;)&quot;);}}

Try it online!
My first language was Java, lol. This is my first answer. It's 1055 bytes. Have fun.
interface T{static void main(String[]a){System.out.print(&quot;The basic idea of a [tag:kolmogorov-complexity] challenge is to print a set output in the shortest code (though that meaning has changed now). We have had many of them, from [Borromean Rings](_%s/53417/ascii-borromean-rings) to [The Gettysburg Address_%s/15395/how-random-is-the-gettysburg-address). \n##Your Task\nThis % is similar, except that it requires printing of a special text - the text of this %. Specifically, the very Markdown code that I am typing right now. \nTo prevent an infinite recursion in the %, the exact text you have to print can be found [here_revisions/1f731ea3-0950-4b03-ae95-24fa812a9a28/view-source). \n##Clarifications\n- You are not allowed to use any external sources like the internet. \n- This means that the purpose of this % is not to download this % text and parse it, but instead to store it in you program. \n- This is [tag:code-golf], so shortest code in **bytes** wins!&quot;.replaceAll(&quot;_&quot;,&quot;])http://codegolf.stackexchange.com/&quot;).replaceAll(&quot;%&quot;,&quot;question&quot;));}}