Pigeonhole and Extremal Arguments · Superchallenge problem

Every sequence of $5$ different numbers contains an increasing or a decreasing subsequence of length $3$. What is the largest $m$ such that EVERY sequence of $50$ different numbers is sure to contain an increasing or a decreasing subsequence of length $m$?