A *1-up quine* is a program which is very similar to a quine. The one major difference is that instead of printing itself once, when **n** copies of the program are concatenated, the result prints the original program **n+1** times.

Example
-------

If your program is `Abc123`:

```
Abc123  ->  Abc123Abc123
Abc123Abc123  ->  Abc123Abc123Abc123
Abc123Abc123Abc123  -> Abc123Abc123Abc123Abc123

```

Challenge
=========

Your challenge is to create the shortest valid 1-up quine in any language. The usual quine rules apply, so you may not:

* Submit the empty program.
* Directly or indirectly read1 the source code.
* Use quining built-ins.

This is code-golf, so **shortest code in bytes wins.**

1This does not include using a hard-coded string or code block as part of your program.