Code Pasta

Untitled

4 years ago in HTML

                            <html><head id="ctl00_ctl00_Head1">
    <title>Guaranty Trust Bank: Internet Banking</title>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
    <meta http-equiv="Page-Enter" content="BlendTrans(Duration=1.0)">
    <meta http-equiv="Site-Exit" content="BlendTrans(Duration=1.0)">
    <meta name="viewport" content="width=device-width; initial-scale=1.0">
    <script type="text/javascript" src="/ibank3/ruxitagentjs_ICA2SVfhjoqr_10193200624125340.js" data-dtconfig="rid=RID_-1748114781|rpid=572555350|domain=gtbank.com|reportUrl=/ibank3/rb_ddd5f2d6-629d-4375-bcaa-1d1c1238183b|app=eb01e145d00cdacd|cuc=sem09ss2|featureHash=ICA2SVfhjoqr|dpvc=1|md=3=a#userTag,2=cRememberMe|lastModification=1601510316822|dtVersion=10193200624125340|tp=500,50,0,1|rdnt=1|uxrgce=1|bp=2|agentUri=/ibank3/ruxitagentjs_ICA2SVfhjoqr_10193200624125340.js"></script><link href="Style/Main.css" rel="stylesheet" type="text/css">
    <script src="js/jquery.js" type="text/javascript"></script>
    
    <script type="text/javascript">
        bpe = 0;
        mask = 0;
        radix = mask + 1;
        digitsStr = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz_=!@#$%^&*()[]{}|;:,.<>/?`~ \\\'\"+-';
        for (bpe = 0; (1 << (bpe + 1)) > (1 << bpe) ; bpe++);
        bpe >>= 1;
        mask = (1 << bpe) - 1;
        radix = mask + 1;
        one = int2bigInt(1, 1, 1);
        t = new Array(0);
        ss = t;
        s0 = t;
        s1 = t;
        s2 = t;
        s3 = t;
        s4 = t; s5 = t;
        s6 = t;
        s7 = t;
        T = t;
        sa = t;
        mr_x1 = t; mr_r = t; mr_a = t;
        eg_v = t; eg_u = t; eg_A = t; eg_B = t; eg_C = t; eg_D = t;
        md_q1 = t; md_q2 = t; md_q3 = t; md_r = t; md_r1 = t; md_r2 = t; md_tt = t;
        primes = t; pows = t; s_i = t; s_i2 = t; s_R = t; s_rm = t; s_q = t; s_n1 = t;
        s_a = t; s_r2 = t; s_n = t; s_b = t; s_d = t; s_x1 = t; s_x2 = t, s_aa = t;
        function findPrimes(n) {
            var i, s, p, ans;
            s = new Array(n);
            for (i = 0; i < n; i++)
                s[i] = 0;
            s[0] = 2;
            p = 0;
            for (; s[p] < n;) {
                for (i = s[p] * s[p]; i < n; i += s[p])
                    s[i] = 1;
                p++;
                s[p] = s[p - 1] + 1;
                for (; s[p] < n && s[s[p]]; s[p]++);
            }
            ans = new Array(p);
            for (i = 0; i < p; i++)
                ans[i] = s[i];
            return ans;
        }
        function millerRabin(x, b) {
            var i, j, k, s;
            if (mr_x1.length != x.length) {
                mr_x1 = dup(x);
                mr_r = dup(x);
                mr_a = dup(x);
            }
            copyInt(mr_a, b);
            copy(mr_r, x);
            copy(mr_x1, x);
            addInt(mr_r, -1);
            addInt(mr_x1, -1);
            k = 0;
            for (i = 0; i < mr_r.length; i++)
                for (j = 1; j < mask; j <<= 1)
                    if (x[i] & j) {
                        s = (k < mr_r.length + bpe ? k : 0);
                        i = mr_r.length;
                        j = mask;
                    } else
                        k++;
            if (s)
                rightShift(mr_r, s);
            powMod(mr_a, mr_r, x);
            if (!equalsInt(mr_a, 1) && !equals(mr_a, mr_x1)) {
                j = 1;
                while (j <= s - 1 && !equals(mr_a, mr_x1)) {
                    squareMod(mr_a, x);
                    if (equalsInt(mr_a, 1)) {
                        return 0;
                    }
                    j++;
                }
                if (!equals(mr_a, mr_x1)) {
                    return 0;
                }
            }
            return 1;
        }
        function bitSize(x) {
            var j, z, w;
            for (j = x.length - 1; (x[j] == 0) && (j > 0) ; j--);
            for (z = 0, w = x[j]; w; (w >>= 1), z++);
            z += bpe * j;
            return z;
        }
        function randTruePrime(ans, k) {
            var c, m, pm, dd, j, r, B, divisible, z, zz, recSize;
            if (primes.length == 0)
                primes = findPrimes(30000);
            if (pows.length == 0) {
                pows = new Array(512);
                for (j = 0; j < 512; j++) {
                    pows[j] = Math.pow(2, j / 511. - 1.);
                }
            }
            c = 0.1;
            m = 20;
            recLimit = 20;
            if (s_i2.length != ans.length) {
                s_i2 = dup(ans);
                s_R = dup(ans);
                s_n1 = dup(ans);
                s_r2 = dup(ans);
                s_d = dup(ans);
                s_x1 = dup(ans);
                s_x2 = dup(ans);
                s_b = dup(ans);
                s_n = dup(ans);
                s_i = dup(ans);
                s_rm = dup(ans);
                s_q = dup(ans);
                s_a = dup(ans);
                s_aa = dup(ans);
            }
            if (k <= recLimit) {
                pm = (1 << ((k + 2) >> 1)) - 1; //pm is binary number with all ones, just over sqrt(2^k)
                copyInt(ans, 0);
                for (dd = 1; dd;) {
                    dd = 0;
                    ans[0] = 1 | (1 << (k - 1)) | Math.floor(Math.random() * (1 << k));  //random, k-bit, odd integer, with msb 1
                    for (j = 1; (j < primes.length) && ((primes[j] & pm) == primes[j]) ; j++) { //trial division by all primes 3...sqrt(2^k)
                        if (0 == (ans[0] % primes[j])) {
                            dd = 1;
                            break;
                        }
                    }
                }
                carry(ans);
                return;
            }
            B = c * k * k;
            if (k > 2 * m)
                for (r = 1; k - k * r <= m;)
                    r = pows[Math.floor(Math.random() * 512)];   //r=Math.pow(2,Math.random()-1);
            else
                r = .5;
            recSize = Math.floor(r * k) + 1;
            randTruePrime(s_q, recSize);
            copyInt(s_i2, 0);
            s_i2[Math.floor((k - 2) / bpe)] |= (1 << ((k - 2) % bpe));   //s_i2=2^(k-2)
            divide(s_i2, s_q, s_i, s_rm);                         //s_i=floor((2^(k-1))/(2q))
            z = bitSize(s_i);
            for (; ;) {
                for (; ;) {  //generate z-bit numbers until one falls in the range [0,s_i-1]
                    randBigInt(s_R, z, 0);
                    if (greater(s_i, s_R))
                        break;
                }               //now s_R is in the range [0,s_i-1]
                addInt(s_R, 1);  //now s_R is in the range [1,s_i]
                add(s_R, s_i);   //now s_R is in the range [s_i+1,2*s_i]
                copy(s_n, s_q);
                mult(s_n, s_R);
                multInt(s_n, 2);
                addInt(s_n, 1);    //s_n=2*s_R*s_q+1
                copy(s_r2, s_R);
                multInt(s_r2, 2);  //s_r2=2*s_R
                //check s_n for divisibility by small primes up to B
                for (divisible = 0, j = 0; (j < primes.length) && (primes[j] < B) ; j++)
                    if (modInt(s_n, primes[j]) == 0) {
                        divisible = 1;
                        break;
                    }
                if (!divisible)
                    if (!millerRabin(s_n, 2))
                        divisible = 1;
                if (!divisible) {
                    addInt(s_n, -3);
                    for (j = s_n.length - 1; (s_n[j] == 0) && (j > 0) ; j--);  //strip leading zeros
                    for (zz = 0, w = s_n[j]; w; (w >>= 1), zz++);
                    zz += bpe * j;                             //zz=number of bits in s_n, ignoring leading zeros
                    for (; ;) {  //generate z-bit numbers until one falls in the range [0,s_n-1]
                        randBigInt(s_a, zz, 0);
                        if (greater(s_n, s_a))
                            break;
                    }
                    addInt(s_n, 3);
                    addInt(s_a, 2);
                    copy(s_b, s_a);
                    copy(s_n1, s_n);
                    addInt(s_n1, -1);
                    powMod(s_b, s_n1, s_n);
                    addInt(s_b, -1);
                    if (isZero(s_b)) {
                        copy(s_b, s_a);
                        powMod(s_b, s_r2, s_n);
                        addInt(s_b, -1);
                        copy(s_aa, s_n);
                        copy(s_d, s_b);
                        GCD(s_d, s_n);
                        if (equalsInt(s_d, 1)) {
                            copy(ans, s_aa);
                            return;
                        }
                    }
                }
            }
        }
        function randBigInt(b, n, s) {
            var i, a;
            for (i = 0; i < b.length; i++)
                b[i] = 0;
            a = Math.floor((n - 1) / bpe) + 1; //# array elements to hold the BigInt
            for (i = 0; i < a; i++) {
                b[i] = Math.floor(Math.random() * (1 << (bpe - 1)));
            }
            b[a - 1] &= (2 << ((n - 1) % bpe)) - 1;
            if (s)
                b[a - 1] |= (1 << ((n - 1) % bpe));
        }
        function GCD(x, y) {
            var i, xp, yp, A, B, C, D, q, sing;
            if (T.length != x.length)
                T = dup(x);
            sing = 1;
            while (sing) { //while y has nonzero elements other than y[0]
                sing = 0;
                for (i = 1; i < y.length; i++) //check if y has nonzero elements other than 0
                    if (y[i]) {
                        sing = 1;
                        break;
                    }
                if (!sing) break; //quit when y all zero elements except possibly y[0]
                for (i = x.length; !x[i] && i >= 0; i--);  //find most significant element of x
                xp = x[i];
                yp = y[i];
                A = 1; B = 0; C = 0; D = 1;
                while ((yp + C) && (yp + D)) {
                    q = Math.floor((xp + A) / (yp + C));
                    qp = Math.floor((xp + B) / (yp + D));
                    if (q != qp)
                        break;
                    t = A - q * C; A = C; C = t;    //  do (A,B,xp, C,D,yp) = (C,D,yp, A,B,xp) - q*(0,0,0, C,D,yp)      
                    t = B - q * D; B = D; D = t;
                    t = xp - q * yp; xp = yp; yp = t;
                }
                if (B) {
                    copy(T, x);
                    linComb(x, y, A, B); //x=A*x+B*y
                    linComb(y, T, D, C); //y=D*y+C*T
                } else {
                    mod(x, y);
                    copy(T, x);
                    copy(x, y);
                    copy(y, T);
                }
            }
            if (y[0] == 0)
                return;
            t = modInt(x, y[0]);
            copyInt(x, y[0]);
            y[0] = t;
            while (y[0]) {
                x[0] %= y[0];
                t = x[0]; x[0] = y[0]; y[0] = t;
            }
        }
        function inverseMod(x, n) {
            var k = 1 + 2 * Math.max(x.length, n.length);
            if (!(x[0] & 1) && !(n[0] & 1)) {  //if both inputs are even, then inverse doesn't exist
                copyInt(x, 0);
                return 0;
            }
            if (eg_u.length != k) {
                eg_u = new Array(k);
                eg_v = new Array(k);
                eg_A = new Array(k);
                eg_B = new Array(k);
                eg_C = new Array(k);
                eg_D = new Array(k);
            }
            copy(eg_u, x);
            copy(eg_v, n);
            copyInt(eg_A, 1);
            copyInt(eg_B, 0);
            copyInt(eg_C, 0);
            copyInt(eg_D, 1);
            for (; ;) {
                while (!(eg_u[0] & 1)) {  //while eg_u is even
                    halve(eg_u);
                    if (!(eg_A[0] & 1) && !(eg_B[0] & 1)) { //if eg_A==eg_B==0 mod 2
                        halve(eg_A);
                        halve(eg_B);
                    } else {
                        add(eg_A, n); halve(eg_A);
                        sub(eg_B, x); halve(eg_B);
                    }
                }
                while (!(eg_v[0] & 1)) {  //while eg_v is even
                    halve(eg_v);
                    if (!(eg_C[0] & 1) && !(eg_D[0] & 1)) { //if eg_C==eg_D==0 mod 2
                        halve(eg_C);
                        halve(eg_D);
                    } else {
                        add(eg_C, n); halve(eg_C);
                        sub(eg_D, x); halve(eg_D);
                    }
                }
                if (!greater(eg_v, eg_u)) { //eg_v <= eg_u
                    sub(eg_u, eg_v);
                    sub(eg_A, eg_C);
                    sub(eg_B, eg_D);
                } else {                   //eg_v > eg_u
                    sub(eg_v, eg_u);
                    sub(eg_C, eg_A);
                    sub(eg_D, eg_B);
                }
                if (equalsInt(eg_u, 0)) {
                    if (negative(eg_C)) //make sure answer is nonnegative
                        add(eg_C, n);
                    copy(x, eg_C);
                    if (!equalsInt(eg_v, 1)) { //if GCD(x,n)!=1, then there is no inverse
                        copyInt(x, 0);
                        return 0;
                    }
                    return 1;
                }
            }
        }
        function inverseModInt(x, n) {
            var a = 1, b = 0, t;
            for (; ;) {
                if (x == 1) return a;
                if (x == 0) return 0;
                b -= a * Math.floor(n / x);
                n %= x;
                if (n == 1) return b; //to avoid negatives, change this b to n-b, and each -= to +=
                if (n == 0) return 0;
                a -= b * Math.floor(x / n);
                x %= n;
            }
        }
        function eGCD(x, y, v, a, b) {
            var g = 0;
            var k = Math.max(x.length, y.length);
            if (eg_u.length != k) {
                eg_u = new Array(k);
                eg_A = new Array(k);
                eg_B = new Array(k);
                eg_C = new Array(k);
                eg_D = new Array(k);
            }
            while (!(x[0] & 1) && !(y[0] & 1)) {  //while x and y both even
                halve(x);
                halve(y);
                g++;
            }
            copy(eg_u, x);
            copy(v, y);
            copyInt(eg_A, 1);
            copyInt(eg_B, 0);
            copyInt(eg_C, 0);
            copyInt(eg_D, 1);
            for (; ;) {
                while (!(eg_u[0] & 1)) {  //while u is even
                    halve(eg_u);
                    if (!(eg_A[0] & 1) && !(eg_B[0] & 1)) { //if A==B==0 mod 2
                        halve(eg_A);
                        halve(eg_B);
                    } else {
                        add(eg_A, y); halve(eg_A);
                        sub(eg_B, x); halve(eg_B);
                    }
                }
                while (!(v[0] & 1)) {  //while v is even
                    halve(v);
                    if (!(eg_C[0] & 1) && !(eg_D[0] & 1)) { //if C==D==0 mod 2
                        halve(eg_C);
                        halve(eg_D);
                    } else {
                        add(eg_C, y); halve(eg_C);
                        sub(eg_D, x); halve(eg_D);
                    }
                }
                if (!greater(v, eg_u)) { //v<=u
                    sub(eg_u, v);
                    sub(eg_A, eg_C);
                    sub(eg_B, eg_D);
                } else {                //v>u
                    sub(v, eg_u);
                    sub(eg_C, eg_A);
                    sub(eg_D, eg_B);
                }
                if (equalsInt(eg_u, 0)) {
                    if (negative(eg_C)) {   //make sure a (C)is nonnegative
                        add(eg_C, y);
                        sub(eg_D, x);
                    }
                    multInt(eg_D, -1);  ///make sure b (D) is nonnegative
                    copy(a, eg_C);
                    copy(b, eg_D);
                    leftShift(v, g);
                    return;
                }
            }
        }
        function negative(x) {
            return ((x[x.length - 1] >> (bpe - 1)) & 1);
        }
        function greaterShift(x, y, shift) {
            var kx = x.length, ky = y.length;
            k = ((kx + shift) < ky) ? (kx + shift) : ky;
            for (i = ky - 1 - shift; i < kx && i >= 0; i++)
                if (x[i] > 0)
                    return 1; //if there are nonzeros in x to the left of the first column of y, then x is bigger
            for (i = kx - 1 + shift; i < ky; i++)
                if (y[i] > 0)
                    return 0; //if there are nonzeros in y to the left of the first column of x, then x is not bigger
            for (i = k - 1; i >= shift; i--)
                if (x[i - shift] > y[i]) return 1;
                else if (x[i - shift] < y[i]) return 0;
            return 0;
        }
        function greater(x, y) {
            var i;
            var k = (x.length < y.length) ? x.length : y.length;
            for (i = x.length; i < y.length; i++)
                if (y[i])
                    return 0;  //y has more digits
            for (i = y.length; i < x.length; i++)
                if (x[i])
                    return 1;  //x has more digits
            for (i = k - 1; i >= 0; i--)
                if (x[i] > y[i])
                    return 1;
                else if (x[i] < y[i])
                    return 0;
            return 0;
        }
        function divide(x, y, q, r) {
            var kx, ky;
            var i, j, y1, y2, c, a, b;
            copy(r, x);
            for (ky = y.length; y[ky - 1] == 0; ky--); //kx,ky is number of elements in x,y, not including leading zeros
            for (kx = r.length; r[kx - 1] == 0 && kx > ky; kx--);
            b = y[ky - 1];
            for (a = 0; b; a++)
                b >>= 1;
            a = bpe - a;
            leftShift(y, a);
            leftShift(r, a);
            copyInt(q, 0);
            while (!greaterShift(y, r, kx - ky)) {
                subShift(r, y, kx - ky);
                q[kx - ky]++;
            }
            for (i = kx - 1; i >= ky; i--) {
                if (r[i] == y[ky - 1])
                    q[i - ky] = mask;
                else
                    q[i - ky] = Math.floor((r[i] * radix + r[i - 1]) / y[ky - 1]);
                for (; ;) {
                    y2 = (ky > 1 ? y[ky - 2] : 0) * q[i - ky];
                    c = y2 >> bpe;
                    y2 = y2 & mask;
                    y1 = c + q[i - ky] * y[ky - 1];
                    c = y1 >> bpe;
                    y1 = y1 & mask;
                    if (c == r[i] ? y1 == r[i - 1] ? y2 > (i > 1 ? r[i - 2] : 0) : y1 > r[i - 1] : c > r[i])
                        q[i - ky]--;
                    else
                        break;
                }
                linCombShift(r, y, -q[i - ky], i - ky);    //r=r-q[i-ky]*leftShift(y,i-ky)
                if (negative(r)) {
                    addShift(r, y, i - ky);         //r=r+leftShift(y,i-ky)
                    q[i - ky]--;
                }
            }
            rightShift(y, a);  //undo the normalization step
            rightShift(r, a);  //undo the normalization step
        }
        function carry(x) {
            var i, k, c, b;
            k = x.length;
            c = 0;
            for (i = 0; i < k; i++) {
                c += x[i];
                b = 0;
                if (c < 0) {
                    b = -(c >> bpe);
                    c += b * radix;
                }
                x[i] = c & mask;
                c = (c >> bpe) - b;
            }
        }
        //return x mod n for bigInt x and integer n.
        function modInt(x, n) {
            var i, c = 0;
            for (i = x.length - 1; i >= 0; i--)
                c = (c * radix + x[i]) % n;
            return c;
        }
        function int2bigInt(t, bits, minSize) {
            var i, k;
            k = Math.ceil(bits / bpe) + 1;
            k = minSize > k ? minSize : k;
            buff = new Array(k);
            copyInt(buff, t);
            return buff;
        }
        function str2bigInt(s, base, minSize) {
            var d, i, j, x, y, kk;
            var k = s.length;
            if (base == -1) { //comma-separated list of array elements in decimal
                x = new Array(0);
                for (; ;) {
                    y = new Array(x.length + 1);
                    for (i = 0; i < x.length; i++)
                        y[i + 1] = x[i];
                    y[0] = parseInt(s, 10);
                    x = y;
                    d = s.indexOf(',', 0);
                    if (d < 1)
                        break;
                    s = s.substring(d + 1);
                    if (s.length == 0)
                        break;
                }
                if (x.length < minSize) {
                    y = new Array(minSize);
                    copy(y, x);
                    return y;
                }
                return x;
            }
            x = int2bigInt(0, base * k, 0);
            for (i = 0; i < k; i++) {
                d = digitsStr.indexOf(s.substring(i, i + 1), 0);
                if (base <= 36 && d >= 36)  //convert lowercase to uppercase if base<=36
                    d -= 26;
                if (d < base && d >= 0) {   //ignore illegal characters
                    multInt(x, base);
                    addInt(x, d);
                }
            }
            for (k = x.length; k > 0 && !x[k - 1]; k--); //strip off leading zeros
            k = minSize > k + 1 ? minSize : k + 1;
            y = new Array(k);
            kk = k < x.length ? k : x.length;
            for (i = 0; i < kk; i++)
                y[i] = x[i];
            for (; i < k; i++)
                y[i] = 0;
            return y;
        }
        function equalsInt(x, y) {
            var i;
            if (x[0] != y)
                return 0;
            for (i = 1; i < x.length; i++)
                if (x[i])
                    return 0;
            return 1;
        }
        function equals(x, y) {
            var i;
            var k = x.length < y.length ? x.length : y.length;
            for (i = 0; i < k; i++)
                if (x[i] != y[i])
                    return 0;
            if (x.length > y.length) {
                for (; i < x.length; i++)
                    if (x[i])
                        return 0;
            } else {
                for (; i < y.length; i++)
                    if (y[i])
                        return 0;
            }
            return 1;
        }
        function isZero(x) {
            var i;
            for (i = 0; i < x.length; i++)
                if (x[i])
                    return 0;
            return 1;
        }
        function bigInt2str(x, base) {
            var i, t, s = "";
            if (s6.length != x.length)
                s6 = dup(x);
            else
                copy(s6, x);
            if (base == -1) { //return the list of array contents
                for (i = x.length - 1; i > 0; i--)
                    s += x[i] + ',';
                s += x[0];
            }
            else { //return it in the given base
                while (!isZero(s6)) {
                    t = divInt(s6, base);  //t=s6 % base; s6=floor(s6/base);
                    s = digitsStr.substring(t, t + 1) + s;
                }
            }
            if (s.length == 0)
                s = "0";
            return s;
        }
        //returns a duplicate of bigInt x
        function dup(x) {
            var i;
            buff = new Array(x.length);
            copy(buff, x);
            return buff;
        }
        //do x=y on bigInts x and y.  x must be an array at least as big as y (not counting the leading zeros in y).
        function copy(x, y) {
            var i;
            var k = x.length < y.length ? x.length : y.length;
            for (i = 0; i < k; i++)
                x[i] = y[i];
            for (i = k; i < x.length; i++)
                x[i] = 0;
        }
        //do x=y on bigInt x and integer y.  
        function copyInt(x, n) {
            var i, c;
            for (c = n, i = 0; i < x.length; i++) {
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function addInt(x, n) {
            var i, k, c, b;
            x[0] += n;
            k = x.length;
            c = 0;
            for (i = 0; i < k; i++) {
                c += x[i];
                b = 0;
                if (c < 0) {
                    b = -(c >> bpe);
                    c += b * radix;
                }
                x[i] = c & mask;
                c = (c >> bpe) - b;
                if (!c) return; //stop carrying as soon as the carry is zero
            }
        }
        function rightShift(x, n) {
            var i;
            var k = Math.floor(n / bpe);
            if (k) {
                for (i = 0; i < x.length - k; i++) //right shift x by k elements
                    x[i] = x[i + k];
                for (; i < x.length; i++)
                    x[i] = 0;
                n %= bpe;
            }
            for (i = 0; i < x.length - 1; i++) {
                x[i] = mask & ((x[i + 1] << (bpe - n)) | (x[i] >> n));
            }
            x[i] >>= n;
        }
        //do x=floor(|x|/2)*sgn(x) for bigInt x in 2's complement
        function halve(x) {
            var i;
            for (i = 0; i < x.length - 1; i++) {
                x[i] = mask & ((x[i + 1] << (bpe - 1)) | (x[i] >> 1));
            }
            x[i] = (x[i] >> 1) | (x[i] & (radix >> 1));  //most significant bit stays the same
        }
        //left shift bigInt x by n bits.
        function leftShift(x, n) {
            var i;
            var k = Math.floor(n / bpe);
            if (k) {
                for (i = x.length; i >= k; i--) //left shift x by k elements
                    x[i] = x[i - k];
                for (; i >= 0; i--)
                    x[i] = 0;
                n %= bpe;
            }
            if (!n)
                return;
            for (i = x.length - 1; i > 0; i--) {
                x[i] = mask & ((x[i] << n) | (x[i - 1] >> (bpe - n)));
            }
            x[i] = mask & (x[i] << n);
        }
        function multInt(x, n) {
            var i, k, c, b;
            if (!n)
                return;
            k = x.length;
            c = 0;
            for (i = 0; i < k; i++) {
                c += x[i] * n;
                b = 0;
                if (c < 0) {
                    b = -(c >> bpe);
                    c += b * radix;
                }
                x[i] = c & mask;
                c = (c >> bpe) - b;
            }
        }
        function divInt(x, n) {
            var i, r = 0, s;
            for (i = x.length - 1; i >= 0; i--) {
                s = r * radix + x[i];
                x[i] = Math.floor(s / n);
                r = s % n;
            }
            return r;
        }
        function linComb(x, y, a, b) {
            var i, c, k, kk;
            k = x.length < y.length ? x.length : y.length;
            kk = x.length;
            for (c = 0, i = 0; i < k; i++) {
                c += a * x[i] + b * y[i];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; i < kk; i++) {
                c += a * x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function linCombShift(x, y, b, ys) {
            var i, c, k, kk;
            k = x.length < ys + y.length ? x.length : ys + y.length;
            kk = x.length;
            for (c = 0, i = ys; i < k; i++) {
                c += x[i] + b * y[i - ys];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; c && i < kk; i++) {
                c += x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function addShift(x, y, ys) {
            var i, c, k, kk;
            k = x.length < ys + y.length ? x.length : ys + y.length;
            kk = x.length;
            for (c = 0, i = ys; i < k; i++) {
                c += x[i] + y[i - ys];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; c && i < kk; i++) {
                c += x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        //do x=x-(y<<(ys*bpe)) for bigInts x and y, and integers a,b and ys.
        //x must be large enough to hold the answer.
        function subShift(x, y, ys) {
            var i, c, k, kk;
            k = x.length < ys + y.length ? x.length : ys + y.length;
            kk = x.length;
            for (c = 0, i = ys; i < k; i++) {
                c += x[i] - y[i - ys];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; c && i < kk; i++) {
                c += x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function sub(x, y) {
            var i, c, k, kk;
            k = x.length < y.length ? x.length : y.length;
            for (c = 0, i = 0; i < k; i++) {
                c += x[i] - y[i];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; c && i < x.length; i++) {
                c += x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function add(x, y) {
            var i, c, k, kk;
            k = x.length < y.length ? x.length : y.length;
            for (c = 0, i = 0; i < k; i++) {
                c += x[i] + y[i];
                x[i] = c & mask;
                c >>= bpe;
            }
            for (i = k; c && i < x.length; i++) {
                c += x[i];
                x[i] = c & mask;
                c >>= bpe;
            }
        }
        function mult(x, y) {
            var i;
            if (ss.length != 2 * x.length)
                ss = new Array(2 * x.length);
            copyInt(ss, 0);
            for (i = 0; i < y.length; i++)
                if (y[i])
                    linCombShift(ss, x, y[i], i);   //ss=1*ss+y[i]*(x<<(i*bpe))
            copy(x, ss);
        }
        //do x=x mod n for bigInts x and n.
        function mod(x, n) {
            if (s4.length != x.length)
                s4 = dup(x);
            else
                copy(s4, x);
            if (s5.length != x.length)
                s5 = dup(x);
            divide(s4, n, s5, x);  //x = remainder of s4 / n
        }
        function multMod(x, y, n) {
            var i;
            if (s0.length != 2 * x.length)
                s0 = new Array(2 * x.length);
            copyInt(s0, 0);
            for (i = 0; i < y.length; i++)
                if (y[i])
                    linCombShift(s0, x, y[i], i);   //s0=1*s0+y[i]*(x<<(i*bpe))
            mod(s0, n);
            copy(x, s0);
        }
        //do x=x*x mod n for bigInts x,n.
        function squareMod(x, n) {
            var i, j, d, c, kx, kn, k;
            for (kx = x.length; kx > 0 && !x[kx - 1]; kx--);  //ignore leading zeros in x
            k = kx > n.length ? 2 * kx : 2 * n.length; //k=# elements in the product, which is twice the elements in the larger of x and n
            if (s0.length != k)
                s0 = new Array(k);
            copyInt(s0, 0);
            for (i = 0; i < kx; i++) {
                c = s0[2 * i] + x[i] * x[i];
                s0[2 * i] = c & mask;
                c >>= bpe;
                for (j = i + 1; j < kx; j++) {
                    c = s0[i + j] + 2 * x[i] * x[j] + c;
                    s0[i + j] = (c & mask);
                    c >>= bpe;
                }
                s0[i + kx] = c;
            }
            mod(s0, n);
            copy(x, s0);
        }
        //return x with exactly k leading zeros
        function trim(x, k) {
            var i, y;
            for (i = x.length; i > 0 && !x[i - 1]; i--);
            y = new Array(i + k);
            copy(y, x);
            return y;
        }
        //do x=x**y mod n, where x,y,n are bigInts (n is odd) and ** is exponentiation.  0**0=1.
        function powMod(x, y, n) {
            var k1, k2, kn, np;
            //calculate np from n for the Montgomery multiplications
            for (kn = n.length; kn > 0 && !n[kn - 1]; kn--);
            np = radix - inverseModInt(modInt(n, radix), radix);
            if (s7.length != n.length)
                s7 = dup(n);
            copyInt(s7, 0);
            s7[kn] = 1;
            multMod(x, s7, n);   // x = x * 2**(kn*bp) mod n
            if (s3.length != x.length)
                s3 = dup(x);
            else
                copy(s3, x);
            for (k1 = y.length - 1; k1 > 0 & !y[k1]; k1--);  //k1=first nonzero element of y
            if (y[k1] == 0) {  //anything to the 0th power is 1
                copyInt(x, 1);
                return;
            }
            for (k2 = 1 << (bpe - 1) ; k2 && !(y[k1] & k2) ; k2 >>= 1);  //k2=position of first 1 bit in y[k1]
            for (; ;) {
                if (!(k2 >>= 1)) {  //look at next bit of y
                    k1--;
                    if (k1 < 0) {
                        mont(x, one, n, np);
                        return;
                    }
                    k2 = 1 << (bpe - 1);
                }
                mont(x, x, n, np);
                if (k2 & y[k1]) //if next bit is a 1
                    mont(x, s3, n, np);
            }
        }
        function mont(x, y, n, np) {
            var i, j, c, ui, t;
            var kn = n.length;
            var ky = y.length;
            if (sa.length != kn)
                sa = new Array(kn);
            for (; kn > 0 && n[kn - 1] == 0; kn--);
            copyInt(sa, 0);
            //the following loop consumes 95% of the runtime for randTruePrime() and powMod() for large keys
            for (i = 0; i < kn; i++) {
                t = sa[0] + x[i] * y[0];
                ui = (t * np) & mask;
                c = (t + ui * n[0]) >> bpe;
                t = x[i];
                //do sa=(sa+x[i]*y+ui*n)/b   where b=2**bpe
                for (j = 1; j < ky; j++) {
                    c += sa[j] + t * y[j] + ui * n[j];
                    sa[j - 1] = c & mask;
                    c >>= bpe;
                }
                for (; j < kn; j++) {
                    c += sa[j] + ui * n[j];
                    sa[j - 1] = c & mask;
                    c >>= bpe;
                }
                sa[j - 1] = c & mask;
            }
            if (!greater(n, sa))
                sub(sa, n);
            copy(x, sa);
        }
        function Encrypt(str, n, e) {
            var n = str2bigInt(n, 16, 0);
            var x = str2bigInt(str, 95, n.length);
            var y = str2bigInt(e, 16, 0);
            powMod(x, y, n, 0);
            x = bigInt2str(x, 16);
            return x;
        }
    </script>
    <script src="js/respond.min.js" type="text/javascript"></script>
    <script src="Scripts/rsa.js"></script>
    <script type="text/javascript">
        $(document).ready(function () {
            $('#' + 'hdDevicePrint').val(unescape(encode_deviceprint()));
        });
    </script>
    <script type="text/javascript">var rumMOKey='d9dfd4df1962647eeef96cfe7f9d3626';(function(){if(window.performance && window.performance.timing && window.performance.navigation) {var site24x7_rum_beacon=document.createElement('script');site24x7_rum_beacon.async=true;site24x7_rum_beacon.setAttribute('src','//static.site24x7rum.com/beacon/site24x7rum-min.js?appKey='+rumMOKey);document.getElementsByTagName('head')[0].appendChild(site24x7_rum_beacon);}})(window)</script><script async="" src="//static.site24x7rum.com/beacon/site24x7rum-min.js?appKey=d9dfd4df1962647eeef96cfe7f9d3626"></script>
<script async="" src="//static.site24x7rum.com/beacon/site24x7rum-min.js?appKey=d9dfd4df1962647eeef96cfe7f9d3626"></script><style type="text/css">* {<br>		-webkit-user-select: text !important;<br>		-moz-user-select: text !important;<br>		-ms-user-select: text !important;<br>		 user-select: text !important;<br>	}</style></head>
<body oncontextmenu="return false">
    <form name="login" method="post" action="Login.aspx" id="login" autocomplete="off">
<input type="hidden" name="__EVENTTARGET" id="__EVENTTARGET" value="">
<input type="hidden" name="__EVENTARGUMENT" id="__EVENTARGUMENT" value="">
<input type="hidden" name="__VIEWSTATE" id="__VIEWSTATE" value="RDlIIjQQRF4TbNovC9cDcFnZNwjcd4glnaM+Y/P/DYJyKZPLWI40uKetKDSoycNQQn/JTEQTluXXpJKfj2crQEtzKj96Jmpc9sTZ/iist4omJbXpjCX+ZPoQGkhnRx5QfUXqroSoVihylSVdqFQoQjMOqHk5+pTLe8vaP9mpK5jRxjpvHEIN9SDFXAk0Um+9CxgDnQ==">
<script type="text/javascript">
<!--
var theForm = document.forms['login'];
if (!theForm) {
    theForm = document.login;
}
function __doPostBack(eventTarget, eventArgument) {
    if (!theForm.onsubmit || (theForm.onsubmit() != false)) {
        theForm.__EVENTTARGET.value = eventTarget;
        theForm.__EVENTARGUMENT.value = eventArgument;
        theForm.submit();
    }
}
// -->
</script>
<script src="/ibank3/WebResource.axd?d=tCRxj1wBdMRTXJbtCzv-lB8cQicDQNS5iUiCW0gCtb8UZSdYuOoZJ4jfynGioITP37rQj0Sq12TzS6ZMH3uwr6s2oeM1&amp;t=636354942046607314" type="text/javascript"></script>
<input type="hidden" name="__VIEWSTATEGENERATOR" id="__VIEWSTATEGENERATOR" value="32F8FDBF">
<input type="hidden" name="__SCROLLPOSITIONX" id="__SCROLLPOSITIONX" value="0">
<input type="hidden" name="__SCROLLPOSITIONY" id="__SCROLLPOSITIONY" value="0">
<input type="hidden" name="__EVENTVALIDATION" id="__EVENTVALIDATION" value="6zTNC7HmUZOWqD/nhwnGrbbrLzS6No35/A4I2F+zzKGGUP5lpPXJtISRElDJNNJytzt/FQIaTndmd2vF3Ywbmci4+CdjG33mzYHZDh0jd+A2J00+BZkeof0JtP3rBwvMFlSpY72KVsLQjn7bZcB9l1FWjVsYUSy8NeSTm9WBTZpQqKWF+lUU1vc+1f52PxwB4E1tpgqIPTx+u8dkq8HmNjF6v30csOYIkHOrD/UhfxlV9MNitrtXkfcjOtT/BIcgimU3KXHrHfScl6tkTVHECmfNdJuU5m3O/MYhkIOFt+gSfbFWCRcbk2NfHS2jU3YhmghrOrzJQtElLpdn7C0tghkH2M2s0EdDhc1YT/eKQcCnR3mCu9y52Tliw39GtKA2CYuXJWfNXtoxzCIcD46SvUv8/n48BqdQ3M2+vh6D/2TXfS4nlnFuMKZ2JAEObFp706cG6z0vE+/T5mE6ISpCWKEUEtU3yTRVbycsVyoo5YmXnU3UUQMsLHecEqplLJ+4mZbwqJTOJAqYtDm9Y4BOUKzKEWwa2zOvqo+ZuMFFfx889ApiY5vcDMboRyOYC3gPeFTQ+zoXCdFOntWp2ZP6tblMs2M=">
        <div id="preContainer">
            <div class="header" style="height: 170px;">
                <div class="logo"></div>
                <div class="grayBar2 clear"></div>
            </div>
            <div class="content">
                <div id="maincontent">
                    <div id="innercontent" class="roundBox loginform">
                        <h3 class="darkGray">Online Realtime Balances and Transactions</h3>
                        <p>Kindly Login with any of <strong class="orange">UserID, Account Number, Phone Number or Email</strong> and use the keypad for your password.</p>
                        <div id="loginpad">
                            <div class="formLabel desktop netbook tablet" style="font-size:15px">UserId: </div>
                            <div class="formInput">
                                <input name="txtUserName" type="text" maxlength="40" size="12" id="txtUserName"></div>
                            <div class="formLabel desktop netbook tablet" style="font-size:15px">Password:</div>
                            <div>
                                
<div class="Keypad">
<div class="formInput">
<input name="Keypad1:txtResult" type="text" id="Keypad1_txtResult" class="passkey" onkeypress="if(event.keyCode==13){document.all('Keypad1_btnOK1').click();return false;}if(event.keyCode==27){document.all('Keypad1_btnCancel').click();return false;}" readonly="readonly" maxlength="8" size="4">  
        <input name="Keypad1:txtPasswordResult" type="password" id="Keypad1_txtPasswordResult" class="passkey" onkeypress="if(event.keyCode==13){document.all('Keypad1_btnOK1').click();return false;}if(event.keyCode==27){document.all('Keypad1_btnCancel').click();return false;}" readonly="readonly" maxlength="8" size="9">      
</div>
	
    <input type="submit" name="Keypad1:btnOK1" value="Login" onclick="sendBHVSignals(); return false;" language="javascript" id="Keypad1_btnOK1" class="FatButton">
	<input type="submit" name="Keypad1:btnOK" value="Login" onclick="managepwd();" language="javascript" id="Keypad1_btnOK" class="FatButton" style="display:none">
    
        <div id="keys">
        <input name="Keypad1:k1" type="button" id="Keypad1_k1" class="keyPadKey" onclick="numClicked(this);" value="8">
        <input name="Keypad1:k2" type="button" id="Keypad1_k2" class="keyPadKey" onclick="numClicked(this);" value="5">
        <input name="Keypad1:k3" type="button" id="Keypad1_k3" class="keyPadKey" onclick="numClicked(this);" value="3">
        <input class="keyPadOrangeKey" onclick="clrClicked(this);" type="button" value="CLR"><br>
        <input name="Keypad1:k4" type="button" id="Keypad1_k4" class="keyPadKey" onclick="numClicked(this);" value="4">
        <input name="Keypad1:k5" type="button" id="Keypad1_k5" class="keyPadKey" onclick="numClicked(this);" value="1">
        <input name="Keypad1:k6" type="button" id="Keypad1_k6" class="keyPadKey" onclick="numClicked(this);" value="7">
        <input class="keyPadOrangeKey" onclick="delClicked(this);" type="button" value="DEL"><br>
        <input name="Keypad1:k7" type="button" id="Keypad1_k7" class="keyPadKey" onclick="numClicked(this);" value="6">
        <input name="Keypad1:k8" type="button" id="Keypad1_k8" class="keyPadKey" onclick="numClicked(this);" value="2">
        <input name="Keypad1:k9" type="button" id="Keypad1_k9" class="keyPadKey" onclick="numClicked(this);" value="9">
        <input name="Keypad1:k10" type="button" id="Keypad1_k10" class="keyPadKey" onclick="numClicked(this);" value="0">
        </div>
        
        
    </div>    
	
        
<!--<script>document.onload=document.all("Keypad1_txtResult").focus();</script>-->
<script language="javascript">
    function focusToInput() {
        try {
            //document.all("Keypad1_txtResult").focus();
        }
        catch (e) {
            document.getElementById("Keypad1_txtPasswordResult").value.focus();
        }
    }
    function numClicked(elem) {
        try {
            //document.all("Keypad1_txtResult").value+=elem.value;
        }
        catch (e) { }
        try {
            document.getElementById("Keypad1_txtPasswordResult").value += elem.value;
            document.getElementById("Keypad1_txtPasswordResult").focus()
            //  document.all("Keypad1_txtPasswordResult").value+=elem.value;
        }
        catch (e) { }
        //document.all("Keypad1_txtResult").focus();
        //focusToInput();
    }
    function delClicked(elem) {
        try {
            //document.all("Keypad1_txtResult").value=document.all("Keypad1_txtResult").value.substr(0,document.all("Keypad1_txtResult").value.length-1);
        }
        catch (e) { }
        try {
            document.getElementById("Keypad1_txtPasswordResult").value = document.getElementById("Keypad1_txtPasswordResult").value.substr(0, document.getElementById("Keypad1_txtPasswordResult").value.length - 1);
            document.getElementById("Keypad1_txtPasswordResult").focus()
        }
        catch (e) { }
        //document.all("Keypad1_txtResult").focus();
        //focusToInput();
    }
    function clrClicked(elem) {
        try {
            //document.all("Keypad1_txtResult").value="";
        }
        catch (e) { }
        try {
            document.getElementById("Keypad1_txtPasswordResult").value = "";
            document.getElementById("Keypad1_txtPasswordResult").focus()
        }
        catch (e) { }
        //document.all("Keypad1_txtResult").focus();
        //focusToInput();;
    }
    function managepwd() {
        document.getElementById("Keypad1_txtPasswordResult").value = Encrypt(document.getElementById("Keypad1_txtPasswordResult").value, 'EFE152DFA62E398BF523FFF69A9535438F83A94DF4C0AB6B0CD4E0E1AE6224278DDF6EE4C99FA869B6E570EC7478D80E4094AB39E06770BCC5FF2020268DCA07', '10001');
    }
    function getPassword() {
        try {
        }
        catch (e) { }
        try {
            var val = "";
            val = document.getElementById("Keypad1_txtPasswordResult").value;
            var password = "";
            password = document.getElementById("Keypad1_txtPasswordResult").value = val;
            //        var xorKey = 129; /// you can have other numeric values also.
            var xorKey = document.getElementById("Keypad1_HiddenVal2").value;
            var result = "";
            for (i = 0; i < password.length; ++i) {
                result += String.fromCharCode(xorKey ^ password.charCodeAt(i));
            }
            document.getElementById("Keypad1_txtPasswordResult").value = result;
        }
        catch (e) { }
    }
     /*Commented for Gemalto*/
    function sendBHVSignals() {
	try
	{
	    var onUrl = '0';
	    if (onUrl = "1") {
	        sendBehavioSecData(submitInformation);
	    }
	    else {
	        submitInformation();
	    }
		}
		catch(err) { 
			submitInformation();
		}
      //  PageMethods.GetData();
    }
    function submitInformation() {
        document.getElementById("Keypad1_btnOK").click();
        }
    /*Gemalto Comment ends here if it needs to be added back*/
</script>
<script type="text/javascript">document.onload=focusToInput();</script>
<input type="hidden" name="Keypad1:HiddenVal2" id="Keypad1_HiddenVal2" value="102">
                            </div>
                             <div>
                                <input type="hidden" name="hdDevicePrint" id="hdDevicePrint" value="version=3.4.0.0_1&amp;pm_fpua=mozilla/5.0 (windows nt 10.0; win64; x64) applewebkit/537.36 (khtml, like gecko) chrome/85.0.4183.121 safari/537.36|5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/85.0.4183.121 Safari/537.36|Win32&amp;pm_fpsc=24|1366|768|728&amp;pm_fpsw=&amp;pm_fptz=0&amp;pm_fpln=lang=en-US|syslang=|userlang=&amp;pm_fpjv=0&amp;pm_fpco=1&amp;pm_fpasw=internal-pdf-viewer|mhjfbmdgcfjbbpaeojofohoefgiehjai|internal-nacl-plugin&amp;pm_fpan=Netscape&amp;pm_fpacn=Mozilla&amp;pm_fpol=true&amp;pm_fposp=&amp;pm_fpup=&amp;pm_fpsaw=1366&amp;pm_fpspd=24&amp;pm_fpsbd=&amp;pm_fpsdx=&amp;pm_fpsdy=&amp;pm_fpslx=&amp;pm_fpsly=&amp;pm_fpsfse=&amp;pm_fpsui=&amp;pm_os=Windows&amp;pm_brmjv=85&amp;pm_br=Chrome&amp;pm_inpt=&amp;pm_expt=">
                                  <input name="revisitid" type="text" id="revisitid" style="display: none;">
                            </div>
                            <div class="clear"></div>
                            <div class="Keypad">
                                <p>
                                    <a id="lkForgetPassword" href="javascript:__doPostBack('lkForgetPassword','')">Forgot your password/UserID?</a><br>
                                    <a id="lkForgetSecque" href="javascript:__doPostBack('lkForgetSecque','')">Forgot your secret question?</a>
				    <!--<a href="https://livechat.gtbank.com" Target="_blank" title="Click here for live chat"><img src="/ibank3/images/live chat icon.png" /></a>   -->                                
                                    <input type="image" name="LnkRegister" id="LnkRegister" src="Images/Register2.png" border="0"> 
                                      </p>
                            </div>
                            <div class="clear"></div>
                              <div class="rmbrMe">
                                <input id="chkRmbrMe" type="checkbox" name="chkRmbrMe"><label for="chkRmbrMe">Remember My UserID</label>
                            </div>
                        </div>
                    </div>
                    <div class="roundBox adbox">
                        <h3 class="darkGray shield">Security Tips</h3>
                        <p>Please note that GTBank
                            <br>
                            will NEVER ask you to provide your PIN (Personal Identification Numbers).</p>
                        <a href="http://www.gtbank.com/securitycentre" target="_blank" class="grayButton">READ MORE</a>
                    </div>
                    <div class="roundBox adbox">
                        <h3 class="darkGray">Do you have a token?</h3>
                        <p class="token">Get a Token today and begin to carry out third party transfers and online payments.</p>
                        <a href="https://www.gtbank.com/personal-banking/services/e-banking/security-token" target="_blank" class="grayButton">GET YOURS</a>
                    </div>
                    <div class="roundBox adbox lastbox">
                        <h3 class="darkGray">Account Transfers (Instant)</h3>
                        <p style="height: 80px">
                            The fastest way to transfer money to other bank accounts
                            <br>
                            <img src="img/ads/ad_trsf.gif">
                        </p>
                        <a href="#" class="grayButton">TRY IT TODAY</a>
                    </div>
                </div>
                <div id="sidebarRight">
                    <div class="roundBox last tablet">
                        <div>
                           
                            <img src="img/adverts/280x315/smehub1.png" alt="GTBank mobile app">
                             <img src="img/adverts/280x315/smehub2.png" alt="GTBank mobile app">
                        </div>
                    </div>
                    <div class="roundBox longad desktop netbook smartphone">
                        <div>
                          
                             <img src="img/adverts/280x315/smehub1.png" alt="GTBank mobile app">
                             <img src="img/adverts/280x315/smehub2.png" alt="GTBank mobile app">
                        </div>
                    </div>
                </div>
                <div class="clear"></div>
            </div>
            <div class="footer">
                <p class="white">
                    <span class="tablet desktop netbook"><a href="http://www.gtbank.com" target="_blank" class="white">GTBANK.COM</a>
                        | </span><a href="http://www.gtbank.com/terms-conditions" target="_blank" class="white">TERMS &amp; CONDITIONS</a>
                    | <a href="http://www.gtbank.com/whistle-blower" target="_blank" class="white">WHISTLE BLOWER</a>
                </p>
            </div>
            <p class="smartphone" style="text-align: right; margin: 0 10px; width: 280px;"><a href="http://www.gtbank.com" target="_blank">WWW.GTBANK.COM</a></p>
            <div class="clear">&nbsp;</div>
        </div>
        <script type="text/javascript">
            if ($(window).width() < 750) {
                $('#ibtext').css({ "margin": "70px px 10px 0px" });
                $('div.header').css({ "height": "130px" });
            }
            $(window).on('resize', function () {
                if ($(window).width() < 750) {
                    $('#ibtext').css({ "margin": "70px 0px 10px 0px" });
                    $('div.header').css({ "height": "130px" });
                }
                else {
                    $('#ibtext').css({ "margin": "95px 0px 0px 0px" });
                    $('div.header').css({ "height": "170px" });
                }
            });
        </script>
        <script type="text/javascript">var rumMOKey='d9dfd4df1962647eeef96cfe7f9d3626';(function(){if(window.performance && window.performance.timing && window.performance.navigation) {var site24x7_rum_beacon=document.createElement('script');site24x7_rum_beacon.async=true;site24x7_rum_beacon.setAttribute('src','//static.site24x7rum.com/beacon/site24x7rum-min.js?appKey='+rumMOKey);document.getElementsByTagName('head')[0].appendChild(site24x7_rum_beacon);}})(window)</script>
    
<script type="text/javascript">
<!--
theForm.oldSubmit = theForm.submit;
theForm.submit = WebForm_SaveScrollPositionSubmit;
theForm.oldOnSubmit = theForm.onsubmit;
theForm.onsubmit = WebForm_SaveScrollPositionOnSubmit;
// -->
</script>
</form>
   
<script type="text/javascript">
		document.oncontextmenu = null;
		document.onselectstart = null;
		document.ondragstart = null;
		document.onmousedown = null;
		document.body.oncontextmenu = null;
		document.body.onselectstart = null;
		document.body.ondragstart = null;
		document.body.onmousedown = null;
		document.body.oncut = null;
		document.body.oncopy = null;
		document.body.onpaste = null;
	</script></body></html>

                        
Recent Public Pastes
6 videos of old men fucking young girls BEST COLLECTION - 1 day ago Amazing Collections - 3 days ago [v1.2.1.0] Farming Simulator 25 Trainer (2025) (Plus +8) - 5 days ago TradingView - 1 week ago Untitled - 1 week ago They Like Nature - 1 week ago Untitled - 2 weeks ago Untitled - 2 weeks ago VIDEOS NO SHORTLINK AT ALL FREEEEEEEEEEEEE - 2 weeks ago Sanyuuu - 2 weeks ago