import java.util.*;
class panagram //ISC 2025 Practical Question
{
//str for storing the sentence
String str;
panagram()
{
str="";
}
void accept()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a sentence:");
str=sc.nextLine();
}
void panagramcheck()
{
int letters[]=new int[26];
StringTokenizer st=new StringTokenizer(str);
while(st.hasMoreTokens())
{
String w = st.nextToken().toUpperCase();
for(int i=65;i<=90;i++)
{
for(int j=0;j<w.length();j++)
{
char ch = w.charAt(j);
if(ch==(char)i)
{
++letters[i-65];
}
}
}
}
int c=0;
for(int i=0;i<letters.length;i++)
{
if(letters[i]!=0)
{
c=c+1;
}
}
if(c==26)
System.out.println("Panagram sentence");
else
System.out.println("Non-panagram sentence");
}
void longest()
{
int l=0;
int n=0;
String longestword="";
StringTokenizer st = new StringTokenizer(str);
while(st.hasMoreTokens())
{
String w = st.nextToken();
if(w.length()>l)
{
l=w.length();
longestword=w;
++n;
}
if(n==2)
{
System.out.println("Longest word:"+longestword);
break;
}
}
}
void shortest()
{
StringTokenizer st = new StringTokenizer(str);
int len=999;
int n=1;
while(st.hasMoreTokens())
{
String w=st.nextToken();
if(len>w.length())
{
len=w.length();
++n;
}
if(n==2)
{
System.out.println("Shortest word: "+w);
break;
}
}
}
public static void main(String args[])
{
panagram ob = new panagram();
ob.accept();
ob.panagramcheck();
ob.longest();
ob.shortest();
}
}