output_description: Print a_i and a_j that you selected, with a space in between.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      n
      a_1 a_2 ... a_n
attempt: h, w = map(int, input().split())
  sl = []
  for _ in range(h):
      row = list(input())
      sl.append(row)
  
  
  dp = [[10000] * h for _ in range(w)]
  dp[0][0] = 0
  
  for wi in range(w):
      for hi in range(h):
          if wi + 1 < w:
              if sl[wi][hi] == "." and sl[wi + 1][hi] == "#":
                  dp[wi + 1][hi] = min(dp[wi + 1][hi], dp[wi][hi] + 1)
              else:
                  dp[wi + 1][hi] = min(dp[wi + 1][hi], dp[wi][hi])
  
          if hi + 1 < h:
              if sl[wi][hi] == "." and sl[wi][hi + 1] == "#":
                  dp[wi][hi + 1] = min(dp[wi][hi + 1], dp[wi][hi] + 1)
              else:
                  dp[wi][hi + 1] = min(dp[wi][hi + 1], dp[wi][hi])
  
  
  ans = dp[w - 1][h - 1]
  if sl[0][0] == "#":
      ans += 1
  print(ans)
  
problem_description: Statement
  
  Let {\rm comb}(n,r) be the number of ways to choose r objects from among n
  objects, disregarding order. From n non-negative integers a_1, a_2, ..., a_n,
  select two numbers a_i > a_j so that {\rm comb}(a_i,a_j) is maximized. If
  there are multiple pairs that maximize the value, any of them is accepted.
samples: [{"input": "5\n    6 9 4 2 11", "output": "11 6\n    \n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n  * \\rm{comb}(4,2)=6\n  * \\rm{comb}(6,2)=15\n  * \\rm{comb}(6,4)=15\n  * \\rm{comb}(9,2)=36\n  * \\rm{comb}(9,4)=126\n  * \\rm{comb}(9,6)=84\n  * \\rm{comb}(11,2)=55\n  * \\rm{comb}(11,4)=330\n  * \\rm{comb}(11,6)=462\n  * \\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\n* * *"}, {"input": "2\n    100 0", "output": "100 0"}]