A fence is defined if it has '-' and/or '|' characters only put next to each other. For example, '|-|- |-' and '|-|-|' are considered valid fences. You are given a fence, define/write the function 'longestFence' that finds and returns the longest fence in a string that is generated randomly with - and | characters.

Examples: 1. |-|-|- 6

2. -|--|||-|---|- 4

3. -|- 3

4. - 1 5.

| 1

6. ----- 1

7. |||||||| 1