# Mohamad Sheikh-Alshabab

@MohamadAlshabab

A skilled full-stack web developer is eager to join a creative, problem-solving team.
Ability to learn and implement new technologies quick

0

The Hulk feelingsDr.Bruce Banner was working on an experimental medical treatment and tested it on himself. Big mistake! Turns out, Dr.Bruce was unknowingly working on a new super soldier program, and the gamma radiation transformed him into Hulk.
He can hardly talk when he turns into the Hulk, and expressing his feelings become complicated because he expresses his feelings by n layers. The first layer is hate, the second is love, the third is hate, and so on...
For example, if n = 1, then his feeling is "I hate it," or if n = 2, it's "I hate that I love it," and if n = 3, it's "I hate that I love that I hate it" and so on.
That's why he asked you to help him to express his feelings.
Input Format
The only line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of layers of love and hate.
Constraints
n (1 ≤ n ≤ 100)
Output Format
Print Dr.Banner's feeling in one line.
Sample Input 0
1
Sample Output 0
I hate it
Sample Input 1
2
Sample Output 1
I hate that I love it

0

0

0

0

max&avgmax&avg

0

0

0

0

Rot13Rot 13
a => n
A=> N
z => m
Z => M

0

0

0

0

square dig numsquare dig num

0

0

0

0

Playing with digitsPlaying with digits

1

0

0

0

Product of consecutive Fib numbersThe Fibonacci numbers are the numbers in the following integer sequence (Fn):
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,
such as
F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.
Given a number, say prod (for product), we search two Fibonacci numbers F(n) and F(n+1) verifying
F(n) * F(n+1) = prod.
Your function productFib takes an integer (prod) and returns an array:
[F(n), F(n+1), true] or {F(n), F(n+1), 1} or (F(n), F(n+1), True)
depending on the language if F(n) * F(n+1) = prod.
If you don't find two consecutive F(n) verifying F(n) * F(n+1) = prodyou will return
[F(n), F(n+1), false] or {F(n), F(n+1), 0} or (F(n), F(n+1), False)
F(n) being the smallest one such as F(n) * F(n+1) > prod.
Some Examples of Return:
(depend on the language
productFib(714) # should return (21, 34, true),
since F(8) = 21, F(9) = 34 and 714 = 21 * 34
productFib(800) # should return (34, 55, false),
since F(8) = 21, F(9) = 34, F(10) = 55 and 21 * 34 < 800 < 34 * 55

0

0

0

0

Stop_gninnipS_My_sdroW!.jsStop gninnipS My sdroW!

0

0

0

0

Phone NumbersPhone Numbers

0

0

0

0

square_n_NumssquarenNums

0

0

0

0

StringRepeatString Repeat

0

0

0

0

RemoveFirstAndLastCharRemove First And Last Char

0

0

0

0

makeNegative5 => -5
-5 => -5
0 => 0

0

0

0

0

Complementary_DNAA => T
T => A
C => G
G => C

0

0

0

0

capitalize first letters of namecapitalize first letters of name

0

0

0

0

shortest word in stringfind shortest word in string and return length of it

0

0

0

0

Find_the_next_perfect_square!.js
Complete the findNextSquare method that finds the next integral perfect square after the one passed as a parameter. Recall that an integral perfect square is an integer n such that sqrt(n) is also an integer.
If the parameter is itself not a perfect square then -1 should be returned. You may assume the parameter is non-negative.
Examples:(Input --> Output)
121 --> 144
625 --> 676
114 --> -1 since 114 is not a perfect square

0

0

0

0

Persistent_Bugger.js39 --> 3 (because 39 = 27, 27 = 14, 1*4 = 4 and 4 has only one digit)
999 --> 4 (because 999 = 729, 729 = 126, 126 = 12, and finally 1*2 = 2)
4 --> 0 (because 4 is already a one-digit number)

0

0

0

0

company team with griddesign page layout using grid system:
example:
https://elzero.org/company-team-with-grid/
image :
https://elzero.org/wp-content/uploads/2021/01/company-team-with-grid.png

1

0

0

0

Birthday Cake CandlesBirthday Cake Candles

0

0

0

0

Time ConversionTime Conversion

0

0

0