#Write a Python program that accepts as an input two strings and finds the maximal alignment 
#score if no internal gaps are allowed and the score of match is 1 and the score of mismatch 
#is 0. The gaps at the beginning and the end of the short sequence are allowed and will be 
#counted as mismatches. The program prints the best alignment. 
#You can assume that length (first sequence) >= length (second sequence) 

def scoreAlign(seq1, seq2):
        i=0
        sum=0
        length=len(seq1)
        while i<length:
                if seq1[i] == seq2[i]:
                        sum = sum + 1
                i = i + 1
        return sum

def bestAlign(seq1, seq2):
	len1 = len(seq1)
        len2 = len(seq2)
        max = 0
        bestSeq2 = seq2

	if  (len1 == len2):
        	max = scoreAlign (seq1, seq2)
		print(max)

	else:
        	dif = len1 - len2
        	i = 0
		while (i  <=  dif):
        		j = 0
        		start = ''
        		while j < i:
				start = start + '-'
                		j = j + 1
        		j = 0
			end = ''
        		while (j < dif - i):
                		end = end + '-'
                		j = j + 1

			newSeq2 = start + seq2 + end
        		score = scoreAlign(seq1, newSeq2)
			print("iteration", i)
			print(seq1)
			print(newSeq2)
			print(score)
			if ( max < score ):
                		max = score
                		bestSeq2 = newSeq2

			i = i + 1
	
	return max, bestSeq2

def main():
	seq1=raw_input("Please enter the first seq ")
	seq2 = raw_input("Please enter the second seq ")
	max, bestSeq2=bestAlign(seq1, seq2)	
	print("\nfinal results")
	print(max)
	print(seq1)
	print(bestSeq2)
main()