## Brainfuck, 83 bytes

    ,[>+[>+<-],]
    >
    [
      >>[<+<-->>-]
      +<[>+<-]
      <-
    ]
    <<
    [
      [<]
      >.,
      >[>]
      >>+>-[<]
      <[[>+<-]++++++++++.,<<]
      <
    ]

[Try it online!](http://brainfuck.tryitonline.net/#code=LFs-K1s-KzwtXSxdPls-Pls8KzwtLT4-LV0rPFs-KzwtXTwtXTw8W1s8XT4uLD5bPl0-Pis-LVs8XTxbWz4rPC1dKysrKysrKysrKy4sPDxdPF0&input=TG9yZW0gaXBzdW0gZG9sb3Igc2l0IGFtdA)

This uses the same idea as Leaky Nun's [answer](https://codegolf.stackexchange.com/a/88968/2537). He asked for help golfing it in chat, then suggested that I add this as a new answer. (Actually what I wrote in chat was an 84-byte solution very similar to this.)

For the sake of comparison, an extra `>` is needed at the beginning for brainfuck implementations that don't allow negative memory addresses.

As expected, this finds the length of the input, then takes the square root, then prints the lines accordingly. It takes advantage of perfect squares being partial sums of `1 + 3 + 5 ...`.