HMMT 2004 U16

An $n$-string is a string of digits formed by writing the numbers $1,2, \ldots, n$ in some order (in base ten). For example, one possible 10-string is

35728910461 What is the smallest $n>1$ such that there exists a palindromic $n$-string?