output_description: If S is coffee-like, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: def dijkstra(s, n, w, cost):
      # 始点sから各頂点への最短距離
      # n:頂点数,　w:辺の数, cost[u][v] : 辺uvのコスト(存在しないときはinf)
      d = [float("inf")] * n
      used = [False] * n
      d[s] = 0
  
      while True:
          v = -1
          # まだ使われてない頂点の中から最小の距離のものを探す
          for i in range(n):
              if (not used[i]) and (v == -1):
                  v = i
              elif (not used[i]) and d[i] < d[v]:
                  v = i
          if v == -1:
              break
          used[v] = True
  
          for j in range(n):
              d[j] = min(d[j], d[v] + cost[v][j])
      return tuple(d)
  
  
  n, x, y = map(int, input().split())
  
  # cost[u][v] : 辺uvのコスト(存在しないときはinf この場合は10**10)
  cost = [[float("inf") for i in range(n)] for i in range(n)]
  
  for i in range(n - 1):
      cost[i][i + 1] = 1
      cost[i + 1][i] = 1
  cost[x - 1][y - 1] = 1
  cost[y - 1][x - 1] = 1
  
  ans = [0 for _ in range(n)]
  for i in range(n):
      # nは頂点数、wは辺の数
      res = dijkstra(i, n, n, cost)
      for j in range(i + 1, n):
          ans[res[j]] += 1
  
  for i in range(1, n):
      print(ans[i])
  
problem_description: Statement
  
  A string of length 6 consisting of lowercase English letters is said to be
  coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th
  and 6-th characters are also equal.  
  Given a string S, determine whether it is coffee-like.
samples: [{"input": "sippuu", "output": "Yes\n    \n\nIn `sippuu`, the 3-rd and 4-th characters are equal, and the 5-th and 6-th\ncharacters are also equal.\n\n* * *"}, {"input": "iphone", "output": "No\n    \n\n* * *"}, {"input": "coffee", "output": "Yes"}]