Find the longest contiguous stretch of strictly rising readings.
Task: Find the length of the longest contiguous strictly increasing run.
Input format: n followed by n integers.
Output format: One integer: the length.
Constraints: 1 <= n <= 100000; -10^9 <= a[i] <= 10^9
Edge rules: Apply the stated zero, tie, boundary, and ordering conventions exactly.