ASCII Borromean Rings The Borromean rings are a curious set of three circles, linked such that the removal of any one of them will unlink the other two:



You can make a set for yourself with a couple rubber bands and a binder ring. With more rubber bands, it's easy to make any Brunnian link.

Write a program or function that outputs (prints or returns) this ascii-art representation of Borromean rings:

    +-----+
    |     |
+-----+   |
|   | |   |
| +-|---+ |
| | | | | |
| | +-|---+
| |   | |
+-|---+ |
  |     |
  +-----+


The lines may have trailing spaces and there may be a trailing newline.

The shortest code in bytes wins.
CJam, 53 51 50 49 bytes
Plain old base conversion...
&quot;FÓîÞ¤ÛY­ËB[¢O²êÍÓ
}²|äG&quot;299b4b&quot;+ -|&quot;f=B/N*

All characters are well in extended ASCII range (ASCII code 1 to 255), so number of characters == number of bytes.
Try it online here and get the original code here