Let $\sigma$ be a random permutation of $\{0, 1, \ldots, 6\}$. Let $L(\sigma)$ be the length of the longest initial monotonic consecutive subsequence of $\sigma$ not containing $0$; for example, \[L(\underline{2,3,4},6,5,1,0) = 3,\ L(\underline{3,2},4,5,6,1,0) = 2,\ L(0,1,2,3,4,5,6) = 0.\] If the expected value of $L(\sigma)$ can be written as $\frac mn$, where $m$ and $n$ are relatively prime positive integers, then find $m + n$.

Let's think step by step and output the final answer within \boxed{}.
user