answer1 = "maybethistime";
q = new Array();

q['q1'] = 'a025696cf5b8fb8710c81dac5b319c1a87d806f8';
q['q2'] = 'c26182b973e69aadff840e7751521a516ab20d12';
q['q3'] = 'c7169f0a0a175d874cbbeba97f9f2542d9209111';
q['q4'] = '31d03bdd517de21bcb4ad54b217d95e939b7a3c3';
q['q5'] = '85f2b89fadb7c16c46bc9a00d872feecc0f44e69';
q['q6'] = 'd258c59730ecbb02478c642ab224b8ca5ec17318';
q['q7'] = 'f16d87a95d1c37ebb24df480a205e7dbb1d7b6e0';
q['q8'] = '524ba71a2033fabb7a1d62e913199dafea2a0118';
q['q9'] = '8a5883764d8a118c94b0a860e6ba43d628062219';
q['q10'] = 'c63ce3ab22fdeb472260c13c6f8d906e70d93281';
q['q11'] = '47ea4373d7e924af885c5cb4c2a9d6c98dd1ac70';
q['q12'] = 'e42e2fe1b5120143c60d26e14ebd6cb1f8e5407f';
q['q13'] = '443d70b2f34c3a2b3c9c275aa2565d51b2aa50da';
q['q14'] = '20a505551bc4ec625d6a84d7e2af7fcaa65411bd';
q['q15'] = '218be277f8fb74e16e189ce0ea9c116337c28f0f';
q['q16'] = 'e777af973d3d0dfa4c9e298ba1db387d7d4bdd81';
q['q17'] = 'a777950edc3ed85936243471d851d2f490e0f45d';
q['q18'] = 'd007fa80d3b8d727e12b24e8ac2ab734b0137dc3';
q['q19'] = '0865e637c81d38e276494bbd006bdda152005819';
q['q20'] = '3d158fa02fea1fe3e00fc0f4a0fc7860493d2b8d';
q['q21'] = '21bd2c51b22a6003435dccf6daf3192ba87c01ec';
q['q22'] = 'c81b49789b681002cb0c24b859969f2bbba994f2';
q['q23'] = '22ee28a2755e7578074dbd60bcd8534774b22520';
q['q24'] = '27fef05c82a1a748c01e31ee0dd79bfa4c4bdf90';
q['q25'] = 'ec502fd52ad648077b7282a3f3cce19b8192ebff';
q['q26'] = 'ff066123900b3b7974bd96b318fd6c8bde29d129';
q['q27'] = '604bd0ce9416d557f74dfb55608a67cb0ccee1d9';
q['q28'] = 'f74f395afd21e7b8c853240ae42296fb1df9b4f1';
q['q29'] = 'fcafd4f533b3cdad05d48a8c3df3666efdb22ded';
q['q30'] = 'c86cba144ef30210e5b8867db3164a1ea0385cd1';
q['q31'] = 'b03df236a1bf274af4460fdb3eed14ac0aeb275b';
q['q32'] = 'b43bf1fbe59923ebcf5a35f7bb8ad958c06f8193';
q['q33'] = 'd08ddae42edcfa48311c342260420fb51edad5ee';
q['q34'] = '2cc1552d06af417e2555375a75f2c50c9fbc1632';
q['q35'] = 'c5e58f7739f18e82bfb383d54949d54fe547d499';
q['q36'] = '7f2db177557fa71ec001b340e36c84c8da7e5e4a';
q['q37'] = 'fc9b5cbe33dcedbe3e54006bbab15e4cefc4a98b';
q['q38'] = '1934c57db182e45156bae0f862a108702cc3bb44';
q['q39'] = '88a4b801b6f1c40c61759cdfc2400d2c9d7a6bcb';
q['q40'] = 'f02bbb085ab91df7a3df62d227c6f496b1f9ff7e';
 
function checkQ(str) {
	if(hex_sha1(document.getElementById(str).value.toUpperCase()) == q[str])
	{
		validate1(str);
	}
	else
	{
		validate2(str);
	}
	
}
function validate1(qstr) {
	if(document.getElementById(qstr).disabled == false) {
	document.getElementById(qstr).disabled = true;
	document.getElementById(qstr).style.border = '2px solid #00FF00'; 
	document.getElementById('correct').innerHTML = document.getElementById('correct').innerHTML*1 + 1;
	document.getElementById('correctB').innerHTML = document.getElementById('correctB').innerHTML*1 + 1;
	}
}

function validate2(qstr) {
	if(document.getElementById(qstr).value=='') {
		document.getElementById(qstr).style.border = '1px solid #A5ACB2'; 
	}
	else
	{
	document.getElementById(qstr).style.border = '2px solid #FF0000'; 
	}
}


/*
 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
 * in FIPS PUB 180-1
 * Version 2.1a Copyright Paul Johnston 2000 - 2002.
 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
 * Distributed under the BSD License
 * See http://pajhome.org.uk/crypt/md5 for details.
 */

/*
 * Configurable variables. You may need to tweak these to be compatible with
 * the server-side, but the defaults work in most cases.
 */
var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
var chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */

/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}

/*
 * Perform a simple self-test to see if the VM is working
 */
function sha1_vm_test()
{
  return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}

/*
 * Calculate the SHA-1 of an array of big-endian words, and a bit length
 */
function core_sha1(x, len)
{
  /* append padding */
  x[len >> 5] |= 0x80 << (24 - len % 32);
  x[((len + 64 >> 9) << 4) + 15] = len;

  var w = Array(80);
  var a =  1732584193;
  var b = -271733879;
  var c = -1732584194;
  var d =  271733878;
  var e = -1009589776;

  for(var i = 0; i < x.length; i += 16)
  {
    var olda = a;
    var oldb = b;
    var oldc = c;
    var oldd = d;
    var olde = e;

    for(var j = 0; j < 80; j++)
    {
      if(j < 16) w[j] = x[i + j];
      else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
      var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
                       safe_add(safe_add(e, w[j]), sha1_kt(j)));
      e = d;
      d = c;
      c = rol(b, 30);
      b = a;
      a = t;
    }

    a = safe_add(a, olda);
    b = safe_add(b, oldb);
    c = safe_add(c, oldc);
    d = safe_add(d, oldd);
    e = safe_add(e, olde);
  }
  return Array(a, b, c, d, e);

}

/*
 * Perform the appropriate triplet combination function for the current
 * iteration
 */
function sha1_ft(t, b, c, d)
{
  if(t < 20) return (b & c) | ((~b) & d);
  if(t < 40) return b ^ c ^ d;
  if(t < 60) return (b & c) | (b & d) | (c & d);
  return b ^ c ^ d;
}

/*
 * Determine the appropriate additive constant for the current iteration
 */
function sha1_kt(t)
{
  return (t < 20) ?  1518500249 : (t < 40) ?  1859775393 :
         (t < 60) ? -1894007588 : -899497514;
}

/*
 * Calculate the HMAC-SHA1 of a key and some data
 */
function core_hmac_sha1(key, data)
{
  var bkey = str2binb(key);
  if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);

  var ipad = Array(16), opad = Array(16);
  for(var i = 0; i < 16; i++)
  {
    ipad[i] = bkey[i] ^ 0x36363636;
    opad[i] = bkey[i] ^ 0x5C5C5C5C;
  }

  var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
  return core_sha1(opad.concat(hash), 512 + 160);
}

/*
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters.
 */
function safe_add(x, y)
{
  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  return (msw << 16) | (lsw & 0xFFFF);
}

/*
 * Bitwise rotate a 32-bit number to the left.
 */
function rol(num, cnt)
{
  return (num << cnt) | (num >>> (32 - cnt));
}

/*
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters >255 have their hi-byte silently ignored.
 */
function str2binb(str)
{
  var bin = Array();
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < str.length * chrsz; i += chrsz)
    bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
  return bin;
}

/*
 * Convert an array of big-endian words to a string
 */
function binb2str(bin)
{
  var str = "";
  var mask = (1 << chrsz) - 1;
  for(var i = 0; i < bin.length * 32; i += chrsz)
    str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
  return str;
}

/*
 * Convert an array of big-endian words to a hex string.
 */
function binb2hex(binarray)
{
  var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i++)
  {
    str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
           hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8  )) & 0xF);
  }
  return str;
}

/*
 * Convert an array of big-endian words to a base-64 string
 */
function binb2b64(binarray)
{
  var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  var str = "";
  for(var i = 0; i < binarray.length * 4; i += 3)
  {
    var triplet = (((binarray[i   >> 2] >> 8 * (3 -  i   %4)) & 0xFF) << 16)
                | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
                |  ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
    for(var j = 0; j < 4; j++)
    {
      if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
      else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
    }
  }
  return str;
}