On hail conjjecture(Ⅱ)continued with On hail conjecture(Ⅰ).At first,by method of sequencing,fall number mean can be obtained.there is mean this tool,theorem 2.2 has been proved,and theorem 2.3.The theorem 2.3 is to say:Dendritic diagram that starts from 1,include all odd integer that greater than 1.This is an equivalent proposition with hail conjecture.This is a theorem here.Theorem 2.5 obtain a upper bound of iterate number of times m,which only has to do with x1.So arbitrarily give an odd integer x1 that greater than 1,it can iterate to 1 after finite step,which is m step.