# Solution of;
# Project Euler Problem 220: Heighway Dragon
# https://projecteuler.net/problem=220
# 
# Let D0 be the two-letter string "Fa". For n≥1, derive Dn from Dn-1 by the 
# string-rewriting rules:"a" → "aRbFR""b" → "LFaLb"Thus, D0 = "Fa", D1 = 
# "FaRbFR", D2 = "FaRbFRRLFaLbFR", and so on. These strings can be interpreted 
# as instructions to a computer graphics program, with "F" meaning "draw 
# forward one unit", "L" meaning "turn left 90 degrees", "R" meaning "turn 
# right 90 degrees", and "a" and "b" being ignored. The initial position of 
# the computer cursor is (0,0), pointing up towards (0,1). Then Dn is an 
# exotic drawing known as the Heighway Dragon of order n. For example, D10 is 
# shown below; counting each "F" as one step, the highlighted spot at (18,16) 
# is the position reached after 500 steps. What is the position of the cursor 
# after 1012 steps in D50 ?Give your answer in the form x,y with no spaces.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 220
    timed.caller(dummy, n, i, prob_id)
