Print invisible text Given a string as input, output a number of whitespace characters (0x0A and 0x20) equal to the length of the string.

For example, given the string Hello, World! your code would need to output exactly 13 whitespace characters and nothing else. These can be any mix of spaces and newlines.

Your code should not output any additional trailing newlines or spaces.

Testcases:

     Input      -&gt; Amount of whitespace to output
"Hello, World!" -&gt; 13
"Hi"            -&gt; 2
"   Don't
Forget about
Existing
Whitespace!   " -&gt; 45
""              -&gt; 0
"             " -&gt; 13
"
"               -&gt; 1


Scoring:

This is code-golf so fewest bytes wins!
Whitespace, 311 150 77 68 65 46 41 38 bytes
-3 bytes thanks to Kevin Cruijssen
-27 bytes thanks to Ephphatha

&nbsp&nbsp
&nbsp&nbsp&nbsp&#9;&nbsp&#9;&nbsp
&nbsp
&nbsp&nbsp
&nbsp&#9;
&#9;&nbsp&#9;&#9;&#9;
&#9;&nbsp&nbsp
&#9;
&nbsp&nbsp
&nbsp



Try it online!
A visible format
'\n  \n   \t \t \n \n  \n \t\n\t \t\t\t\n\t  \n\t\n  \n \n\n'

Explanation (s = space, t = tab, n = new line)
nssn     # label(NULL) - loop start
ssststsn # push 10 in the stack -&gt; [10]
sns      # duplicate the top of the stack -&gt; [10, 10]
sns      # duplicate the top of the stack -&gt; [10, 10, 10]
tnts     # read a single char from input, pop the stack and store at that address -&gt; [10, 10] [10:&lt;char that was read&gt;]
ttt      # pop the stack and put the value at that adress on stack -&gt; [10,&lt;char&gt;] [10:&lt;char&gt;]
ntssn    # jump to label(0) - since label(0) is not defined, the interpreter jumps to the end of the program - if the top of the stack (char) is 0 -&gt; [10] [10:&lt;char&gt;]
tnss     # pop the top of the stack and print as ascii -&gt; [] [10:&lt;char&gt;]
nsnn     # go back to the label(NULL)