import Data.Char (digitToInt, intToDigit);
import Data.List (elemIndex);
import Data.Maybe (fromJust);
import System (getArgs);

egin :: String;
egin = "82665409266027476709324472";

zipadj2 :: (a -> a -> b) -> [a] -> [b];
zipadj2 p y = zipWith p (init y) (tail y);

main = do {	
	args <- getArgs;
	let { 
		ss = head (args ++ [egin]); 
		s = map digitToInt ss;
		d = map (flip mod 10) (zipadj2 (-) s);
		gr x y = x * succ y;
		lu k = let {
			h = scanr1 gr (map (fromEnum . (k ==)) d :: [Int]);
			mh = maximum h;
		} in (fromJust (elemIndex mh h), succ mh);
		pl1@(_, l1) = lu 1;
		pl9@(_, l9) = lu 9;
		(p, l) = if l9 <= l1 then pl1 else pl9;
		fs = map intToDigit;
	};
	putStr ("The longest subsequence you want starts at position " ++ 
		show p ++ " and has length " ++ show l ++ " and its contents are (" ++
		fs (take l (drop p s)) ++ ").\n" ++ 
		"In context, it's here: " ++
		fs (take p s) ++ "(" ++ fs (take l (drop p s)) ++ ")" ++
		fs (drop l (drop p s)) ++ ".\n");
};