NGM  A Game with Numbers
Nikifor and Trofim play the following game: they write some positive integer smaller than 2,000,000,000 and take turns one after another. Nikifor is the first to make a move. The turn is made by the following rule: from the written integer any nonzero digit is subtracted, and the new integer replaces the old one on the desk. For example for integer 40534, the next move can be: 40530, 40531 or 40529. The winner is the player who writes zero on the desk.
Write a program to decide who will win if both players do their best.
Input
The input contains the positive integer from which the game is started.
Output
In the first line you must write 1 if Nikifor wins and 2 otherwise. If Nikifor wins then in the second line you must output the move in the first turn which guarantees victory for him. If there are many such moves then output any of them.
Example
Input: 14 Output: 1 4
Author: Filimonenkov D.O.
hide comments
markaman:
20181227 17:58:10
EASY HAI BHAI PAPER WORK KARO...


harry_shit:
20180904 13:04:06
easy one but great logic!! 

bhaskar_06:
20180726 16:23:50
natak tha be 

vaibhavmishra:
20180711 22:46:47
AC in 8 lines of python... :) 

ajayc1007:
20180615 08:23:53
SPOILERS ;( 

incomplet_:
20180417 09:44:55
Best move means that they try their best to win the game, it does not mean the largest number in each turn 

srjsunny:
20180124 16:04:57
long long int will work


bani_raheja:
20180115 10:23:09
Last edit: 20181226 19:13:34 

michaelscof:
20171029 09:50:26
The easiest one on spoj.just pen and paper needed. 

hitesh87:
20171005 13:26:13
easy AC in one go!!! 
Added by:  Roman Sol 
Date:  20060505 
Time limit:  0.620s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ZCon 2007 