Task: Question Answering
Input (English): Problem: let n be the greatest number that will divide 1305 , 4665 and 6905 , leaving the same remainder in each case . then sum of the digits in n is : 
Options: a ) 4 , b ) 5 , c ) 6 , d ) 8 , e ) 10
Output (English): a