{"raw_statement":[{"iden":"statement","content":"Jonathan and Jason are huge weeaboos who spend all their time at home watching anime and reading light novels. But one day, the Google restaurant \"Charlie's\" was closed to all employees due to an invasion of wild UBC interns, so Jonathan and Jason spontaneously decided to go bowling. Unfortunately, the wild UBC interns got to the Google bowling alley \"Gooowling Galley\" first, and all the lanes were out of order, although actually they were out of order for several months already and the entire building was just a front for Baidu's secret invasion, but that's a problem for another time...\n\nBasically Jonathan and Jason somehow ended up at a mysterious and sketchy location in Jupiter, the bowling alley \"Jowling Jalley\". The Martians are very skilled bowlers, so instead of using a mere 10 pins arranged in a triangle, with sides of length 4, the Martians use up to 210 pins arranged in a triangle, with sides of length 4 ≤ n ≤ 20. Jonathan is very bad at bowling, so he forced Jason to play the \"easy mode\" variation with him, which is only popular among little children who watch cartoons.\n\nIn the \"easy mode\" variation, a hi-tech forcefield made out of op-amps and shafts under fatigue loading physically prevents the ball from knocking down any pins other than the first one, at the tip of the triangle. However, that first pin can still knock down the pins behind it, which can knock down more pins behind it, like a pile of Panago's. Basically, due to the hi-tech physics involved (it involves calculations of the von Mises stress using the Coulomb–Mohr criterion), the forcefield mysteriously warps causality in such a way that a pin can only be knocked down if both pins in front of it are also knocked down.\n\nFor example, after rolling the bowling ball, the first three positions below are possible, where _o_ is an upright pin and _x_ is a knocked-down pin. However, the last three positions are impossible, because at least one of the pins in front of pin _X_ are not knocked down.\n\nAfter every roll, a JeleVision (a telly made of jelly) displays a mysterious and sketchy animated video of a cartoon bowling ball knocking over cartoon bowling pins. This made Jonathan and Jason very excited because they are huge weeaboos. But they were also UBC students in the past, so naturally they wondered, how many animated videos did Jmazon (the company that owns the bowling alley \"Jowling Jalley\") have to produce? Jmazon has to produce exactly one animated video for every possible position that the pins can end up in, after Jonathan or Jason rolls the bowling ball once.\n\nThe only line of the input is the integer n, the side length of the triangle of pins (4 ≤ n ≤ 20).\n\nPrint the integer x, the number of possible positions after one roll in the Jowling Jalley, with the \"easy mode\" variation.\n\n"},{"iden":"input","content":"The only line of the input is the integer n, the side length of the triangle of pins (4 ≤ n ≤ 20)."},{"iden":"output","content":"Print the integer x, the number of possible positions after one roll in the Jowling Jalley, with the \"easy mode\" variation."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"Let $ n \\in \\mathbb{Z} $ with $ 4 \\leq n \\leq 20 $.\n\nDefine a triangular arrangement of pins with $ \\frac{n(n+1)}{2} $ pins, where pin at position $ (i,j) $ (row $ i $, left-to-right in row $ i $, $ 1 \\leq j \\leq i $) is supported by pins at $ (i-1,j-1) $ and $ (i-1,j) $ for $ i \\geq 2 $, $ 2 \\leq j \\leq i-1 $, and by a single pin above for edge pins.\n\nA configuration is valid if and only if for every knocked-down pin at $ (i,j) $ with $ i \\geq 2 $, both pins $ (i-1,j-1) $ and $ (i-1,j) $ (if they exist) are also knocked down.\n\nThe top pin $ (1,1) $ is always knocked down (due to the forcefield constraint).\n\nLet $ S_n $ be the set of all valid configurations of knocked-down pins under this dependency rule.\n\n**Objective**: Compute $ |S_n| $.","simple_statement":"Given a triangular arrangement of pins with side length n (4 ≤ n ≤ 20), where a pin can only fall if both pins directly in front of it are already fallen, and the first pin (top) is always knocked down by the ball, count the total number of possible final pin configurations after one roll.","has_page_source":false}