Problem: Martha — as a professional problemsetter — proposed a problem for a world-class contest. This is the problem statement:

Tomorrow is Nadia's birthday, and Bardia (her brother) is assigned to make the balloons ready!

There are n balloons (initially empty) that are tied to a straight line on certain positions x1, x2, ..., xn. Bardia inflates the balloons from left to right. As a result, i-th balloon gets bigger and bigger until its radius reaches the pressure endurance pi or it touches another previously-inflated balloon.

<image>

While Bardia was busy with the balloons, he wondered "What will be the sum of radius of balloons after all of the balloons are inflated?". Being a nerdy type of guy, he is now thinking about the problem instead of preparing his sister's birthday. Calculate the answer to Bardia's problem so that Nadia's birthday won't be balloon-less.

Artha — Martha's student — claimed his solution got accepted. Martha (being his teacher for a long time!) knew he couldn't have solved the problem for real and thus thinks there is something wrong with the testcases. Artha isn't anyhow logical, which means there is no way for Martha to explain the wrong point in his algorithm. So, the only way is to find a testcase to prove him wrong!

Artha's pseudo-code is shown below:

<image>

You should output a small testcase for the problem such that Artha's algorithm is incorrect. The algorithm's output is considered correct if it differs from the correct value by no more than 1.

Input

Please pay attention! No input will be given to your program for this problem. So you do not have to read from the input anything.

Output

You should output the generated small testcase (which Artha's solution doesn't get it right). It should be in the following format:

  * First line must contain the only number n (1 ≤ n ≤ 500). 
  * The i-th of the next n lines should contain the description of the i-th balloon — two space-separated integers xi, pi (1 ≤ pi ≤ 106, 0 ≤ x1 < x2 < ... < xn ≤ 106). 

Examples

Note

The testcase depicted in the figure above (just showing how output should be formatted):
    
    
      
    4  
    0 9  
    6 3  
    12 7  
    17 1  
    

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
string S =
    "402\n1 1000000\n40001 400\n40800 399\n41597 398\n42392 397\n43185 "
    "396\n43976 395\n44765 394\n45552 393\n46337 392\n47120 391\n47901 "
    "390\n48680 389\n49457 388\n50232 387\n51005 386\n51776 385\n52545 "
    "384\n53312 383\n54077 382\n54840 381\n55601 380\n56360 379\n57117 "
    "378\n57872 377\n58625 376\n59376 375\n60125 374\n60872 373\n61617 "
    "372\n62360 371\n63101 370\n63840 369\n64577 368\n65312 367\n66045 "
    "366\n66776 365\n67505 364\n68232 363\n68957 362\n69680 361\n70401 "
    "360\n71120 359\n71837 358\n72552 357\n73265 356\n73976 355\n74685 "
    "354\n75392 353\n76097 352\n76800 351\n77501 350\n78200 349\n78897 "
    "348\n79592 347\n80285 346\n80976 345\n81665 344\n82352 343\n83037 "
    "342\n83720 341\n84401 340\n85080 339\n85757 338\n86432 337\n87105 "
    "336\n87776 335\n88445 334\n89112 333\n89777 332\n90440 331\n91101 "
    "330\n91760 329\n92417 328\n93072 327\n93725 326\n94376 325\n95025 "
    "324\n95672 323\n96317 322\n96960 321\n97601 320\n98240 319\n98877 "
    "318\n99512 317\n100145 316\n100776 315\n101405 314\n102032 313\n102657 "
    "312\n103280 311\n103901 310\n104520 309\n105137 308\n105752 307\n106365 "
    "306\n106976 305\n107585 304\n108192 303\n108797 302\n109400 301\n110001 "
    "300\n110600 299\n111197 298\n111792 297\n112385 296\n112976 295\n113565 "
    "294\n114152 293\n114737 292\n115320 291\n115901 290\n116480 289\n117057 "
    "288\n117632 287\n118205 286\n118776 285\n119345 284\n119912 283\n120477 "
    "282\n121040 281\n121601 280\n122160 279\n122717 278\n123272 277\n123825 "
    "276\n124376 275\n124925 274\n125472 273\n126017 272\n126560 271\n127101 "
    "270\n127640 269\n128177 268\n128712 267\n129245 266\n129776 265\n130305 "
    "264\n130832 263\n131357 262\n131880 261\n132401 260\n132920 259\n133437 "
    "258\n133952 257\n134465 256\n134976 255\n135485 254\n135992 253\n136497 "
    "252\n137000 251\n137501 250\n138000 249\n138497 248\n138992 247\n139485 "
    "246\n139976 245\n140465 244\n140952 243\n141437 242\n141920 241\n142401 "
    "240\n142880 239\n143357 238\n143832 237\n144305 236\n144776 235\n145245 "
    "234\n145712 233\n146177 232\n146640 231\n147101 230\n147560 229\n148017 "
    "228\n148472 227\n148925 226\n149376 225\n149825 224\n150272 223\n150717 "
    "222\n151160 221\n151601 220\n152040 219\n152477 218\n152912 217\n153345 "
    "216\n153776 215\n154205 214\n154632 213\n155057 212\n155480 211\n155901 "
    "210\n156320 209\n156737 208\n157152 207\n157565 206\n157976 205\n158385 "
    "204\n158792 203\n159197 202\n159600 201\n160001 200\n160400 199\n160797 "
    "198\n161192 197\n161585 196\n161976 195\n162365 194\n162752 193\n163137 "
    "192\n163520 191\n163901 190\n164280 189\n164657 188\n165032 187\n165405 "
    "186\n165776 185\n166145 184\n166512 183\n166877 182\n167240 181\n167601 "
    "180\n167960 179\n168317 178\n168672 177\n169025 176\n169376 175\n169725 "
    "174\n170072 173\n170417 172\n170760 171\n171101 170\n171440 169\n171777 "
    "168\n172112 167\n172445 166\n172776 165\n173105 164\n173432 163\n173757 "
    "162\n174080 161\n174401 160\n174720 159\n175037 158\n175352 157\n175665 "
    "156\n175976 155\n176285 154\n176592 153\n176897 152\n177200 151\n177501 "
    "150\n177800 149\n178097 148\n178392 147\n178685 146\n178976 145\n179265 "
    "144\n179552 143\n179837 142\n180120 141\n180401 140\n180680 139\n180957 "
    "138\n181232 137\n181505 136\n181776 135\n182045 134\n182312 133\n182577 "
    "132\n182840 131\n183101 130\n183360 129\n183617 128\n183872 127\n184125 "
    "126\n184376 125\n184625 124\n184872 123\n185117 122\n185360 121\n185601 "
    "120\n185840 119\n186077 118\n186312 117\n186545 116\n186776 115\n187005 "
    "114\n187232 113\n187457 112\n187680 111\n187901 110\n188120 109\n188337 "
    "108\n188552 107\n188765 106\n188976 105\n189185 104\n189392 103\n189597 "
    "102\n189800 101\n190001 100\n190200 99\n190397 98\n190592 97\n190785 "
    "96\n190976 95\n191165 94\n191352 93\n191537 92\n191720 91\n191901 "
    "90\n192080 89\n192257 88\n192432 87\n192605 86\n192776 85\n192945 "
    "84\n193112 83\n193277 82\n193440 81\n193601 80\n193760 79\n193917 "
    "78\n194072 77\n194225 76\n194376 75\n194525 74\n194672 73\n194817 "
    "72\n194960 71\n195101 70\n195240 69\n195377 68\n195512 67\n195645 "
    "66\n195776 65\n195905 64\n196032 63\n196157 62\n196280 61\n196401 "
    "60\n196520 59\n196637 58\n196752 57\n196865 56\n196976 55\n197085 "
    "54\n197192 53\n197297 52\n197400 51\n197501 50\n197600 49\n197697 "
    "48\n197792 47\n197885 46\n197976 45\n198065 44\n198152 43\n198237 "
    "42\n198320 41\n198401 40\n198480 39\n198557 38\n198632 37\n198705 "
    "36\n198776 35\n198845 34\n198912 33\n198977 32\n199040 31\n199101 "
    "30\n199160 29\n199217 28\n199272 27\n199325 26\n199376 25\n199425 "
    "24\n199472 23\n199517 22\n199560 21\n199601 20\n199640 19\n199677 "
    "18\n199712 17\n199745 16\n199776 15\n199805 14\n199832 13\n199857 "
    "12\n199880 11\n199901 10\n199920 9\n199937 8\n199952 7\n199965 6\n199976 "
    "5\n199985 4\n199992 3\n199997 2\n200000 1\n999999 1000000\n";
int main() { cout << S; }